Bounds for the chromatic number of a graph
From MaRDI portal
Publication:5572941
DOI10.1016/S0021-9800(69)80010-4zbMATH Open0182.57802MaRDI QIDQ5572941FDOQ5572941
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Recommendations
Cited In (26)
- Inequalities for the chromatic numbers of graphs
- New upper bounds for the chromatic number of a graph
- Title not available (Why is that?)
- Bounds for the chromatic number of graphs with partial information
- Inequalities between the domination number and the chromatic number of a graph
- Bounds for mean colour numbers of graphs
- Algorithmic bounds for the chromatic number†
- Bounds for the Grundy chromatic number of graphs in terms of domination number
- Inequalities involving the irredundance number of a graph
- Graphs isomorphisms under edge-replacements and the family of amoebas
- Lower bounds for the clique and the chromatic numbers of a graph
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- Title not available (Why is that?)
- A bound on the chromatic number of an almost planar graph
- A sequential coloring algorithm for finite sets
- Graph theory
- A bound on the total chromatic number
- Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs
- Title not available (Why is that?)
- Improved bounds for the chromatic number of a graph
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Approximating the chromatic polynomial of a graph
- Bounds for the chromatic number of some \(pK_2\)-free graphs
- On bounding the chromatic number of L-graphs
- A dualistic approach to bounding the chromatic number of a graph
- Chromatic number versus chromatic number in graphs with bounded clique number
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)
