Randić index and coloring number of a graph
From MaRDI portal
Publication:741549
DOI10.1016/j.dam.2014.06.024zbMath1300.05111OpenAlexW1972992959MaRDI QIDQ741549
Baoyindureng Wu, Xiaojing Yang, Juan Yan
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.06.024
Related Items
On the geometric-arithmetic index of a graph ⋮ More bounds for the Grundy number of graphs ⋮ Upper bounds for the achromatic and coloring numbers of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof for a conjecture on the Randić index of graphs with diameter
- On a relation between the Randić index and the chromatic number
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- 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
- The point-arboricity of a graph
- Graph colorings with local constraints -- a survey
- The Point-Arboricity of Planar Graphs
This page was built for publication: Randić index and coloring number of a graph