Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number

DOI10.1016/j.disc.2008.12.022zbMath1229.05145MaRDI QIDQ1043938

Pierre Hansen, Damir Vukičević

Publication date: 10 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.022

zbMATH Keywords

graph; chromatic number; minimum degree; Randić index; maximum degree; autographix; AGX

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

Related Items

On the extremal properties of the average eccentricity, A proof of two conjectures on the Randić index and the average eccentricity, 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 neighbourhood search: Methods and applications, Proof of conjectures involving algebraic connectivity of graphs, Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index

Uses Software

• AutoGraphiX

Cites Work

• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• AutoGraphiX: a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item