Name
Abstract | ||
|---|---|---|
Letp≧2 be a fixed integer, and letG be a connected graph onn vertices. Ifδ(G)≧2, ifd(u)+d(v)>2n/p−2 holds wheneveruv∉E(G), and ifn is sufficiently large compared top, then eitherG has a spanning eulerian subgraph, orG is contractible to a graphG1 of order less thenp and with no spanning eulerian subgraph. The casep=2 was proved by Lesniak-Foster and Williamson. The casep=5 was conjectured by Benhocine, Clark, Köhler, and Veldman, when they proved virtually the casep=3. The inequality is best-possible. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1007/BF02189088 | Combinatorica |
Keywords | Field | DocType |
connected graph | Graph theory,Integer,Discrete mathematics,Graph,Combinatorics,Minimum degree spanning tree,Vertex (geometry),Contractible space,Eulerian path,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
8 | 4 | 1439-6912 |
Citations | PageRank | References |
11 | 1.34 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul A. Catlin | 1 | 514 | 66.29 |