Name
Abstract | ||
|---|---|---|
Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jctb.1996.0009 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
supereulerian graph,petersen graph,connected graph | Discrete mathematics,Nauru graph,Combinatorics,Cubic graph,Generalized Petersen graph,Apex graph,Distance-regular graph,Petersen family,Petersen graph,Mathematics,Voltage graph | Journal |
Volume | Issue | ISSN |
66 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
18 | 1.54 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul A. Catlin | 1 | 514 | 66.29 |
| Hong-Jian Lai | 2 | 18 | 1.54 |