On color critical graphs

DOI10.1016/0095-8956(85)90066-8zbMath0566.05030OpenAlexW2092384805MaRDI QIDQ1059085

Vojtěch Rödl, Zsolt Tuza

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90066-8

zbMATH Keywords

bipartite graphgirthcritical graphTurán's theoremtransitive automorphism groupomission of edges

Mathematics Subject Classification ID

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

Related Items (8)

Subgraphs of colour-critical graphs ⋮ A class of edge critical 4-chromatic graphs ⋮ On constructive methods in the theory of colour-critical graphs ⋮ Problems on cycles and colorings ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges ⋮ On graphs with strongly independent color-classes ⋮ 4-chromatic graphs with large odd girth

Cites Work

• Ensembles d'articulation d'un graphe \(\gamma\)-critique
• On the combinatorial problems which I would most like to see solved
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On color critical graphs