Bounds for the chromatic number of a graph

DOI10.1016/S0021-9800(69)80010-4MaRDI QIDQ5572941zbMATHFDO

Authors J. A. Bondy

Publication date 1969

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

boundsvertex degreeschromatic number of graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 2099158
• New bounds for the chromatic number of graphs
• Bounds for the chromatic number of graphs with partial information
• New upper bounds for the chromatic number of a graph
• Algorithmic bounds for the chromatic number†

Cited in

(28)

• Graph theory
• scientific article; zbMATH DE number 6612817 (Why is no real title available?)
• New upper bounds for the chromatic number of a graph
• Proof of a conjectured lower bound on the chromatic number of a graph
• scientific article; zbMATH DE number 2099158 (Why is no real title available?)
• Bounds for the chromatic number of graphs with partial information
• Approximating the chromatic polynomial of a graph
• A dualistic approach to bounding the chromatic number of a graph
• A bound on the total chromatic number
• Chromatic number versus chromatic number in graphs with bounded clique number
• Improved bounds for the chromatic number of a graph
• Lower bounds for the clique and the chromatic numbers of a graph
• A bound on the chromatic number of an almost planar graph
• scientific article; zbMATH DE number 3683613 (Why is no real title available?)
• Bounds for the chromatic number of some \(pK_2\)-free graphs
• Inequalities between the domination number and the chromatic number of a graph
• On lower bounds for the chromatic number in terms of vertex degree
• Inequalities involving the irredundance number of a graph
• On bounding the chromatic number of L-graphs
• A sequential coloring algorithm for finite sets
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs
• Bounds for mean colour numbers of graphs
• Algorithmic bounds for the chromatic number†
• Graphs isomorphisms under edge-replacements and the family of amoebas
• Inequalities for the chromatic numbers of graphs
• Bounds for the Grundy chromatic number of graphs in terms of domination number
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices

This page was built for publication: Bounds for the chromatic number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572941)