A class of edge critical 4-chromatic graphs

DOI10.1007/BF03352991zbMath0881.05044OpenAlexW1970985397MaRDI QIDQ1359372

Guantao Chen, András Gyárfás, Richard H. Schelp

Publication date: 16 February 1998

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03352991

zbMATH Keywords

bipartite graphindependent edgeschromatic graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Unnamed Item ⋮ The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges ⋮ Tools for counting odd cycles in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On color critical graphs
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• On cycle—Complete graph ramsey numbers
• Sparse color‐critical graphs and hypergraphs with no short cycles
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems

This page was built for publication: A class of edge critical 4-chromatic graphs