Another bound on the chromatic number of a graph

DOI10.1016/0012-365X(78)90167-XzbMath0384.05043OpenAlexW1964627887MaRDI QIDQ1248527

Paul A. Catlin

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90167-x

Mathematics Subject Classification ID

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

Related Items (11)

The \(m\)-degenerate chromatic number of a digraph ⋮ Chromatic properties of the Pancake graphs ⋮ Brooks' Theorem and Beyond ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Large cliques in graphs with high chromatic number ⋮ Graphs with chromatic number close to maximum degree ⋮ Partitioning of a graph into induced subgraphs not containing prescribed cliques ⋮ Destroying Noncomplete Regular Components in Graph Partitions ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A note on coloring vertex-transitive graphs

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

This page was built for publication: Another bound on the chromatic number of a graph