Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
From MaRDI portal
Publication:1422414
DOI10.1016/S0012-365X(03)00311-XzbMath1031.05068WikidataQ123277778 ScholiaQ123277778MaRDI QIDQ1422414
Pierre Hansen, Gilles Caporossi
Publication date: 14 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (48)
A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH ⋮ Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs ⋮ On the Palindromic Hosoya Polynomial of Trees ⋮ On a conjecture about the Randić index ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Old and new results on algebraic connectivity of graphs ⋮ The geometric-arithmetic index and the chromatic number of connected graphs ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ On the extremal cacti of given parameters with respect to the difference of Zagreb indices ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ On the relation between the positive inertia index and negative inertia index of weighted graphs ⋮ Using size for bounding expressions of graph invariants ⋮ Proof of conjectures on remoteness and proximity in graphs ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships ⋮ Corrections of proofs for Hansen and Mélot's two theorems ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ Minimum values of the second largest \(Q\)-eigenvalue ⋮ A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation ⋮ Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number ⋮ A survey of automated conjectures in spectral graph theory ⋮ On bags and bugs ⋮ Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance ⋮ A sharp upper bound on algebraic connectivity using domination number ⋮ Bounds and conjectures for the signless Laplacian index of graphs ⋮ Variable neighbourhood search: methods and applications ⋮ Relationship between the rank and the matching number of a graph ⋮ On the extremal values of the second largest \(Q\)-eigenvalue ⋮ Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph ⋮ Comparing Zagreb indices for connected graphs ⋮ Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille ⋮ Nordhaus-Gaddum relations for proximity and remoteness in graphs ⋮ Proximity, remoteness and girth in graphs ⋮ Relation between the skew-rank of an oriented graph and the independence number of its underlying graph ⋮ On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph ⋮ Proofs of conjectures on the Randić index and average eccentricity ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees ⋮ Variable neighbourhood search: Methods and applications ⋮ Proximity and remoteness in graphs: Results and conjectures ⋮ Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments ⋮ On the nullity number of graphs ⋮ Unnamed Item ⋮ Computers and discovery in algebraic graph theory ⋮ Trees of extremal connectivity index ⋮ AutoGraphiX: a survey ⋮ The difference between remoteness and radius of a graph
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On conjectures of Graffiti
- Man-machine theorem proving in graph theory
- INGRID: A graph invariant manipulator
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The four-colour theorem
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs 3
- A compilation of relations between graph invariants
- A compilation of relations between graph invariants—supplement I
- Every Planar Map is Four Colorable
- Computation of the Folkman numberFe(3, 3; 5)
- Isomorph-Free Exhaustive Generation
- Fast generation of cubic graphs
- Sale of the century?
This page was built for publication: Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
