On critical subgraphs of colour-critical graphs

DOI10.1016/0012-365X(74)90045-4zbMath0271.05112MaRDI QIDQ759160

Bjarne Toft

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (19)

Dwarf, brick, and triangulation of the torus ⋮ On complete subgraphs of color-critical graphs ⋮ Subgraphs of colour-critical graphs ⋮ Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs ⋮ On generalized graph colorings ⋮ On constructive methods in the theory of colour-critical graphs ⋮ Small graphs with chromatic number 5: A computer search ⋮ Graph coloring satisfying restraints ⋮ A vertex critical graph without critical edges ⋮ Partitioning sparse graphs into an independent set and a forest of bounded degree ⋮ A Brooks type theorem for the maximum local edge connectivity ⋮ (\(\Delta-k\))-critical graphs ⋮ Five-coloring graphs on the Klein bottle ⋮ Hajos' graph-coloring conjecture: Variations and counterexamples ⋮ Generalizations of independence and chromatic numbers of a graph ⋮ Chromatic partitions of a graph ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces ⋮ Partitioning graphs into complete and empty graphs ⋮ Tools for counting odd cycles in graphs

Cites Work

• An Investigation of Colour-Critical Graphs with Complements of Low Connectivity
• On the structure of 5- and 6-chromatic abstract graphs.
• The structure of k-chromatic graphs
• On the theory of graphs
• On cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On critical subgraphs of colour-critical graphs