Name
Abstract | ||
|---|---|---|
The coupled graph c(G) of a plane graph G is the graph defined on the vertex set V(G)∪F(G) so that two vertices in c(G) are joined by an edge if and only if they are adjacent or incident in G. We prove that the coupled graph of a 2-connected plane graph is edge-pancyclic. However, there exists a 2-edge-connected plane graph G such that c(G) is not Hamiltonian. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0166-218X(01)00307-9 | Discrete Applied Mathematics |
Keywords | Field | DocType |
2-edge-connected plane graph,plane graph g,2-connected plane graph,coupled graph,edge-panciclicity,ear decomposition,plane graph | Discrete mathematics,Combinatorics,Edge-transitive graph,Vertex-transitive graph,Bound graph,Graph power,Quartic graph,Symmetric graph,Mathematics,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
119 | 3 | Discrete Applied Mathematics |
Citations | PageRank | References |
8 | 0.78 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ko-wei Lih | 1 | 529 | 58.80 |
| Song Zengmin | 2 | 8 | 0.78 |
| Wang Weifan | 3 | 18 | 1.53 |
| Zhang Kemin | 4 | 8 | 0.78 |