On critical subgraphs of colour-critical graphs
From MaRDI portal
Publication:759160
DOI10.1016/0012-365X(74)90045-4zbMath0271.05112MaRDI QIDQ759160
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Small graphs with chromatic number 5: A computer search, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, Five-coloring graphs on the Klein bottle, Graph coloring satisfying restraints, Partitioning graphs into complete and empty graphs, Dwarf, brick, and triangulation of the torus, Subgraphs of colour-critical graphs, On constructive methods in the theory of colour-critical graphs, A vertex critical graph without critical edges, Hajos' graph-coloring conjecture: Variations and counterexamples, Chromatic partitions of a graph, 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, Generalizations of independence and chromatic numbers of a graph, On complete subgraphs of color-critical graphs, Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs, Tools for counting odd cycles in graphs, On generalized graph colorings
Cites Work
