On list critical graphs

DOI10.1016/j.disc.2008.05.021zbMath1229.05157OpenAlexW1978197112WikidataQ56389553 ScholiaQ56389553MaRDI QIDQ1044925

Michael Stiebitz, Margit Voigt, Zsolt Tuza

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.021

zbMATH Keywords

list coloringcritical graph

Mathematics Subject Classification ID

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

Related Items (3)

The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ Generalized DP-colorings of graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• On the minimal number of edges in color-critical graphs
• The colour theorems of Brooks and Gallai extended
• Choosability of powers of circuits
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• On two intersecting set systems and k-continuous Boolean functions
• Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
• The list chromatic index of a bipartite multigraph
• Note on the colouring of graphs
• A list version of Dirac's theorem on the number of edges in colour-critical graphs
• The number of edges in critical graphs.
• Graph colorings with local constraints -- a survey
• On Representatives of Subsets
• Sur les Ensembles de Sommets Indépendants Dans les Graphes Chromatiques Minimaux
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• The structure of k-chromatic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On list critical graphs