Some inequalities on the chromatic number of a graph

DOI10.1016/0012-365X(74)90023-5zbMath0311.05111OpenAlexW2005574836MaRDI QIDQ1219298

S. Singh

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90023-5

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Normal hypergraphs and the perfect graph conjecture
• The Strong Perfect Graph Conjecture for Planar Graphs
• Paths and Circuits in Critical Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some inequalities on the chromatic number of a graph