On critical subgraphs of colour-critical graphs

DOI10.1016/0012-365X(74)90045-4zbMATH Open0271.05112MaRDI QIDQ759160FDOQ759160

Authors: 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)

Cites Work

• Title not available (Why is that?)
• On cliques in graphs
• On the theory of graphs
• Title not available (Why is that?)
• The structure of k-chromatic graphs
• On the structure of 5- and 6-chromatic abstract graphs.
• An Investigation of Colour-Critical Graphs with Complements of Low Connectivity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (19)

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

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

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