Name
Abstract | ||
|---|---|---|
A sequence of 4-connected graphs G0,G1,...,Gn is called a (G0,Gn)-chain if each Gi (i<n) has an edge ei such that Gi/ei=Gi+1. A classical result of Martinov states that for every 4-connected graph G there exists a (G,H)-chain such that H∈C∪L, where C={Cn2:n≥5} and L={L:L be the line graph of a cyclically 4-edge-connected cubic graph}. This result is strengthened in this paper as follows. Suppose G is 4-connected and G∉C∪L. Then there exists a (G,C62)-chain if G is planar and a (G,C52)-chain if G is nonplanar. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jctb.2018.07.005 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
4-connected graphs,Chain theorem,Contractible edge,Nonplanar graphs | Graph,Combinatorics,Line graph,Cubic graph,Physics | Journal |
Volume | ISSN | Citations |
134 | 0095-8956 | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengfu Qin | 1 | 41 | 5.47 |
| Guoli Ding | 2 | 444 | 51.58 |