Another bound on the chromatic number of a graph
From MaRDI portal
Publication:1248527
DOI10.1016/0012-365X(78)90167-XzbMath0384.05043MaRDI QIDQ1248527
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Destroying Noncomplete Regular Components in Graph Partitions, Graphs with chromatic number close to maximum degree, Graph theory (algorithmic, algebraic, and metric problems)
Cites Work
- Unnamed Item
- Unnamed Item
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Covering the vertex set of a graph with subgraphs of smaller degree
- A bound on the chromatic number of a graph
- On the Genus of Graphs with Lick-White Number k
- Graph Decompositions Satisfying Extremal Degree Constraints