Upper bounds for the achromatic and coloring numbers of a graph
From MaRDI portal
Publication:516843
DOI10.1016/j.dam.2016.09.005zbMath1358.05120arXiv1511.00537OpenAlexW2962915229WikidataQ130351879 ScholiaQ130351879MaRDI QIDQ516843
Clive Elphick, Baoyindureng Wu
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.00537
Related Items (8)
Upper bound for DP-chromatic number of a graph ⋮ Notes on the harmonic index of graphs ⋮ Positive and negative square energies of graphs ⋮ Two conjectured strengthenings of Turán's theorem ⋮ On the geometric-arithmetic index of a graph ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph ⋮ The harmonic index of a graph and its DP-chromatic number
Uses Software
Cites Work
- Conjectured bounds for the sum of squares of positive eigenvalues of a graph
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- Sandwiching the (generalized) Randić index
- Randić index and the diameter of a graph
- A proof for a conjecture on the Randić index of graphs with diameter
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- On a relation between the Randić index and the chromatic number
- Randić index and coloring number of a graph
- Proof of a conjectured lower bound on the chromatic number of a graph
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- Bounds of eigenvalues of graphs
- A bound on the spectral radius of graphs with \(e\) edges
- On the conjecture of Aouchiche and Hansen about the Randić index
- Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
- On the harmonic index and the chromatic number of a graph
- Graph colorings with local constraints -- a survey
- 25 pretty graph colouring problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Upper bounds for the achromatic and coloring numbers of a graph