On complete 4-partite graphs with spanning maximal planar subgraphs
A spanning maximal planar subgraph T = (V E0) is a spanning planar subgraph of a simple, finite, undirected graph G = (V E), with the property of being a maximal planar graph. That is, there exists a drawing of T on the plane, such that there are no edge-crossings and all the regions of T are bounde...
Saved in:
Main Author: | Estrada, Tjaart Jan B. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2018
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_doctoral/553 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Resistance distance in complete n-partite graphs
by: Gervacio, Severino V.
Published: (2016) -
On the intersection graph of isomorphic subgraphs of a graph
by: Lomibao, Bernadette G., et al.
Published: (2009) -
The intersection graph of isomorphic subgraphs of a graph
by: Garcia, Mark Anthony A., et al.
Published: (2008) -
Searching for generator subgraphs
by: Celo, Anna Carmina E., et al.
Published: (2009) -
Subdivision number of large complete graphs and large complete multipartite graphs
by: Gervacio, Severino V.
Published: (2005)