The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges

DOI10.1016/J.EJC.2014.12.002zbMATH Open1307.05071OpenAlexW2010343794MaRDI QIDQ2255804FDOQ2255804

Authors Benjamin Reiniger, Alexandr Kostochka

Publication date 18 February 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2014.12.002

zbMATH Keywords

girthbipartite graphscritical graphtransitive automorphism groupomission of edgesTurán's theorem

Mathematics Subject Classification ID

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

Recommendations

• On color critical graphs
• A class of edge critical 4-chromatic graphs
• On the edge-density of 4-critical graphs
• Making a \(K_4\)-free graph bipartite
• Colour-critical graphs with few edges

Cites work

• scientific article; zbMATH DE number 1943966 (Why is no real title available?)
• A class of edge critical 4-chromatic graphs
• Colorings and orientations of graphs
• On color critical graphs
• On the degrees of the vertices of a directed graph
• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Ore's conjecture on color-critical graphs is almost true

Cited in

(3)

• Tools for counting odd cycles in graphs
• Kempe equivalence of almost bipartite graphs
• Critical graphs for the chromatic edge-stability number

This page was built for publication: The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges

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