Paths and Circuits in Critical Graphs

DOI10.2307/2372652MaRDI QIDQ5828509zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(18)

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

This page was built for publication: Paths and Circuits in Critical Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5828509)