Variable neighborhood search for extremal graphs 3
From MaRDI portal
Publication:2756161
DOI10.1080/03081080108818690zbMath1003.05058MaRDI QIDQ2756161
Pierre Hansen, Gilles Caporossi, Slobodan K. Simic, Dragos Cvetković
Publication date: 27 January 2002
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080108818690
05C05: Trees
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille, Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph, Facet defining inequalities among graph invariants: The system graphedron, A survey of automated conjectures in spectral graph theory, Variable neighbourhood search: methods and applications, Variable neighbourhood search: Methods and applications, Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures, Computers and discovery in algebraic graph theory, Corrections of proofs for Hansen and Mélot's two theorems, On the index of caterpillars, On bags and bugs, Some results on the index of unicyclic graphs, AutoGraphiX: a survey, Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Uses Software
Cites Work
