The structure of k-chromatic graphs

Cited in

(32)

On list critical graphs
Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs
On constructive methods in the theory of colour-critical graphs
A practical approach to the chromatic partition problem
Size, chromatic number, and connectivity
On color critical graphs with large adaptable chromatic numbers
Partitioning sparse graphs into an independent set and a forest of bounded degree
A Brooks type theorem for the maximum local edge connectivity
A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
The dichromatic number of a digraph
Counting critical subgraphs in \(k\)-critical graphs
Immersion and clustered coloring
Point partition numbers: decomposable and indecomposable critical graphs
The minimum number of edges in 4-critical digraphs of given order
Generalized hypergraph coloring
On separating sets of edges in contraction-critical graphs
Colour-critical graphs and hypergraphs
Structure in sparse k-critical graphs
Graphs with chromatic number close to maximum degree
A Uniform Set Covering Lemma
Coloring graphs with two odd cycle lengths
Tomescu's Graph Coloring Conjecture for \ell-Connected Graphs
Die graphentheoretische Lösung eines nichtlinearen Zuteilungsproblems
Generalized DP-colorings of graphs
Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision
Graphs with girth 2 +1 and without longer odd holes are 3-colorable
A lower bound on the number of edges in DP-critical graphs
Hadwiger's conjecture for 3-arc graphs
Planar 4-critical graphs with four triangles
On critical subgraphs of colour-critical graphs
Bemerkungen zu Hadwigers Vermutung
An analogue of Dirac's theorem on circular super-critical graphs

This page was built for publication: The structure of k-chromatic graphs

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