Facet defining inequalities among graph invariants: The system graphedron
From MaRDI portal
Publication:944740
DOI10.1016/j.dam.2007.09.005zbMath1152.05380OpenAlexW2121361530MaRDI QIDQ944740
Publication date: 10 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.005
Related Items
Upper bounding rainbow connection number by forest number ⋮ Towards objective measures of algorithm performance across instance space ⋮ Generating new test instances by evolving in instance space ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Trees with given stability number and minimum number of stable sets ⋮ A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) ⋮ Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ The stochastic pseudo-star degree centrality problem ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Integer sequence discovery from small graphs ⋮ Connected Vertex Covers in Dense Graphs ⋮ Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships ⋮ A survey of automated conjectures in spectral graph theory ⋮ Connected vertex covers in dense graphs ⋮ Improved approximation bounds for edge dominating set in dense graphs ⋮ GrInvIn in a nutshell ⋮ Fibonacci index and stability number of graphs: a polyhedral study ⋮ Turán Graphs, Stability Number, and Fibonacci Index ⋮ House of graphs 2.0: a database of interesting graphs and more ⋮ Counting the number of non-equivalent vertex colorings of a graph
Uses Software
Cites Work
- On conjectures of Graffiti
- How good are convex hull algorithms?
- Shelling polyhedral 3-balls and 4-polytopes
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Computers and discovery in algebraic graph theory
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs 3
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Polymake: an approach to modular software design in computational geometry
- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
- Computing and Combinatorics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
