Facet defining inequalities among graph invariants: The system graphedron
From MaRDI portal
(Redirected from Publication:944740)
Recommendations
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- AutoGraphiX: an automated system for finding conjectures in graph theory
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
Cites work
- Computers and discovery in algebraic graph theory
- Computing and Combinatorics
- How far is, should and could be conjecture-making in graph theory an automated process?
- How good are convex hull algorithms?
- scientific article; zbMATH DE number 4173028 (Why is no real title available?)
- scientific article; zbMATH DE number 4173029 (Why is no real title available?)
- scientific article; zbMATH DE number 4191740 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3845636 (Why is no real title available?)
- scientific article; zbMATH DE number 3825879 (Why is no real title available?)
- scientific article; zbMATH DE number 3906548 (Why is no real title available?)
- scientific article; zbMATH DE number 4041962 (Why is no real title available?)
- scientific article; zbMATH DE number 4081618 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1743972 (Why is no real title available?)
- scientific article; zbMATH DE number 861421 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- On conjectures of Graffiti
- polymake: a framework for analyzing convex polytopes
- Polymake: an approach to modular software design in computational geometry
- Shelling polyhedral 3-balls and 4-polytopes
- Variable neighborhood search for extremal graphs 3
- Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs.
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- What forms do interesting conjectures have in graph theory?
Cited in
(24)- Improved approximation bounds for edge dominating set in dense graphs
- GrInvIn in a nutshell
- Fibonacci index and stability number of graphs: a polyhedral study
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
- Automated conjecturing. III. Property-relations conjectures
- Trees with given stability number and minimum number of stable sets
- House of graphs 2.0: a database of interesting graphs and more
- Upper bounding rainbow connection number by forest number
- Counting the number of non-equivalent vertex colorings of a graph
- Towards objective measures of algorithm performance across instance space
- Generating new test instances by evolving in instance space
- Connected Vertex Covers in Dense Graphs
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Exploring the role of graph spectra in graph coloring algorithm performance
- Turán Graphs, Stability Number, and Fibonacci Index
- Conjectures of TxGraffiti: independence, domination, and matchings
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
- The stochastic pseudo-star degree centrality problem
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs
- Automated conjecturing with TxGraffiti
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Integer sequence discovery from small graphs
- A survey of automated conjectures in spectral graph theory
- Connected vertex covers in dense graphs
This page was built for publication: Facet defining inequalities among graph invariants: The system graphedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944740)
