On list critical graphs

DOI10.1016/J.DISC.2008.05.021MaRDI QIDQ1044925zbMATH OpenOpenAlexDBLPWikidataFDO

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

Recommendations

• On complete subgraphs of color-critical graphs
• Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs
• Edge lower bounds for list critical graphs, via discharging
• On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs
• List bouble-critical graphs

Cites work

• scientific article; zbMATH DE number 446487 (Why is no real title available?)
• scientific article; zbMATH DE number 3427388 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• scientific article; zbMATH DE number 1303523 (Why is no real title available?)
• scientific article; zbMATH DE number 1341914 (Why is no real title available?)
• scientific article; zbMATH DE number 3446936 (Why is no real title available?)
• scientific article; zbMATH DE number 889958 (Why is no real title available?)
• scientific article; zbMATH DE number 3361909 (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?)
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A list version of Dirac's theorem on the number of edges in colour-critical graphs
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• Choosability of powers of circuits
• Graph colorings with local constraints -- a survey
• Note on the colouring of graphs
• On Representatives of Subsets
• On the minimal number of edges in color-critical graphs
• On two intersecting set systems and k-continuous Boolean functions
• Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
• Sur les Ensembles de Sommets Indépendants Dans les Graphes Chromatiques Minimaux
• The colour theorems of Brooks and Gallai extended
• The list chromatic index of a bipartite multigraph
• The number of edges in critical graphs.
• The structure of k-chromatic graphs

Cited in

(4)

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Critically paintable, choosable or colorable graphs
• The choice number versus the chromatic number for graphs embeddable on orientable surfaces
• Generalized DP-colorings of graphs

This page was built for publication: On list critical graphs

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