On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs

DOI10.1016/J.DISC.2012.11.010MaRDI QIDQ1937546zbMATH OpenOpenAlexFDO

Authors Alexandr Kostochka

Publication date 1 March 2013

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-degenerate graphcolor critical graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 1452400
• Color-critical graphs and hypergraphs with few edges: a survey
• Decomposable and indecomposable critical hypergraphs
• On the number of edges in colour-critical graphs and hypergraphs
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs

Cited in

(1)

• On coloring box graphs

This page was built for publication: On almost \((k-1)\)-degenerate \((k+1)\)-chromatic graphs and hypergraphs

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