A bound on the chromatic number of a graph

DOI10.1016/0012-365X(78)90049-3zbMath0374.05023MaRDI QIDQ1245229

Paul A. Catlin

Publication date: 1978

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

Mathematics Subject Classification ID

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

Related Items (25)

The \(m\)-degenerate chromatic number of a digraph ⋮ Approximation of Constraint Satisfaction via local search ⋮ Coloring immersion-free graphs ⋮ A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor ⋮ Constructing Graphs with No Immersion of Large Complete Graphs ⋮ Clique immersion in graphs without a fixed bipartite graph ⋮ New upper bounds for the chromatic number of a graph ⋮ A minimum degree condition forcing complete graph immersion ⋮ Hadwiger's Conjecture for Graphs with Forbidden Holes ⋮ On Brooks' Theorem for Sparse Graphs ⋮ A note on Reed's conjecture for triangle-free graphs ⋮ On triangle-free list assignments ⋮ Randomly colouring graphs (a combinatorial view) ⋮ A note on the independence number of triangle-free graphs. II ⋮ Some remarks on the odd Hadwiger's conjecture ⋮ Destroying Noncomplete Regular Components in Graph Partitions ⋮ Fractional coloring and the odd Hadwiger's conjecture ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A Weakening of the Odd Hadwiger's Conjecture ⋮ Another bound on the chromatic number of a graph ⋮ Chromatic number, girth and maximal degree ⋮ Coloring Sparse Hypergraphs ⋮ Note on coloring graphs without odd-\(K_k\)-minors ⋮ Unnamed Item ⋮ Distributed coloring algorithms for triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item

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