On critical subgraphs of colour-critical graphs
From MaRDI portal
Publication:759160
Cites work
- scientific article; zbMATH DE number 3269727 (Why is no real title available?)
- scientific article; zbMATH DE number 3358507 (Why is no real title available?)
- scientific article; zbMATH DE number 3409385 (Why is no real title available?)
- scientific article; zbMATH DE number 3195967 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- An Investigation of Colour-Critical Graphs with Complements of Low Connectivity
- On cliques in graphs
- On the structure of 5- and 6-chromatic abstract graphs.
- On the theory of graphs
- The structure of k-chromatic graphs
Cited in
(19)- Small graphs with chromatic number 5: A computer search
- Tools for counting odd cycles in graphs
- Hajos' graph-coloring conjecture: Variations and counterexamples
- On generalized graph colorings
- Five-coloring graphs on the Klein bottle
- Partitioning sparse graphs into an independent set and a forest of bounded degree
- Graph coloring satisfying restraints
- A vertex critical graph without critical edges
- Fractional coloring methods with applications to degenerate graphs and graphs on surfaces
- On constructive methods in the theory of colour-critical graphs
- (\(\Delta-k\))-critical graphs
- Generalizations of independence and chromatic numbers of a graph
- Subgraphs of colour-critical graphs
- Chromatic partitions of a graph
- Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs
- Partitioning graphs into complete and empty graphs
- Dwarf, brick, and triangulation of the torus
- On complete subgraphs of color-critical graphs
- A Brooks type theorem for the maximum local edge connectivity
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)
