Inequalities for the chromatic numbers of graphs

DOI10.1016/0095-8956(74)90097-5zbMath0277.05111OpenAlexW1978345914MaRDI QIDQ1393405

Klaus Schürger

Publication date: 1974

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(74)90097-5

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Unnamed Item ⋮ Chromatic numbers of layered graphs with a bounded maximal clique

Cites Work

• Parallel concepts in graph theory
• On Complementary Graphs
• Graph Theory and Probability
• Graph Union and Chromatic Number†
• On a theorem of Nordhaus and Gaddum
• Bounds for the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inequalities for the chromatic numbers of graphs