Paths and Circuits in Critical Graphs

DOI10.2307/2372652zbMath0056.16902OpenAlexW2332292422MaRDI QIDQ5828509

John B. Kelly, Leroy M. Kelly

Publication date: 1954

Published in: American Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2372652

zbMATH Keywords

Topology

Related Items

Subgraphs of colour-critical graphs ⋮ Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs ⋮ On constructive methods in the theory of colour-critical graphs ⋮ Structure and algorithms for (cap, even hole)-free graphs ⋮ New construction of graphs with high chromatic number and small clique number ⋮ Graph coloring satisfying restraints ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Valentine convexity in n dimensions ⋮ On circuits and subgraphs of chromatic graphs ⋮ A practical approach to the chromatic partition problem ⋮ Color-critical graphs have logarithmic circumference ⋮ Some inequalities on the chromatic number of a graph ⋮ Toughness in graphs -- a survey ⋮ Long cycles in critical graphs ⋮ Colour-critical graphs and hypergraphs ⋮ Infinite generalized friendship graphs ⋮ Heawood's theorem and connectivity