Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
From MaRDI portal
Publication:3548730
DOI10.1002/NET.20250zbMATH Open1151.05334OpenAlexW3013552619MaRDI QIDQ3548730FDOQ3548730
Authors: Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman 
Publication date: 17 December 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22943
Recommendations
- Facet defining inequalities among graph invariants: The system graphedron
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- A compilation of relations between graph invariants—supplement I
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
- Optimization and highly informative graph invariants
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the independence number of a graph in terms of order and size
- Facet defining inequalities among graph invariants: The system graphedron
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A compilation of relations between graph invariants
- A note on the irregularity of graphs
- On conjectures of Graffiti
- How good are convex hull algorithms?
- Turán's theorem and k‐connected graphs
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs 3
- Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs.
- Title not available (Why is that?)
- Computers and discovery in algebraic graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- A compilation of relations between graph invariants—supplement I
Cited In (11)
- Facet defining inequalities among graph invariants: The system graphedron
- Fibonacci index and stability number of graphs: a polyhedral study
- The minimum spectral radius of graphs with a given independence number
- A graph-theoretic algorithm for constructing a committee of an inconsistent system of linear inequalities
- On the sum of independence number and average degree of a graph
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- The size of graphs with given feedback vertex number
- Automated conjecturing. III. Property-relations conjectures
- Turán Graphs, Stability Number, and Fibonacci Index
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- A survey of automated conjectures in spectral graph theory
Uses Software
This page was built for publication: Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548730)
