GraPHedron
From MaRDI portal
Software:36871
swMATH25129MaRDI QIDQ36871FDOQ36871
Author name not available (Why is that?)
Cited In (19)
- Counting the number of non-equivalent vertex colorings of a graph
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Improved approximation bounds for edge dominating set in dense graphs
- Towards objective measures of algorithm performance across instance space
- Facet defining inequalities among graph invariants: The system graphedron
- Connected vertex covers in dense graphs
- Fibonacci index and stability number of graphs: a polyhedral study
- Title not available (Why is that?)
- Upper bounding rainbow connection number by forest number
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Exploring the role of graph spectra in graph coloring algorithm performance
- Generating new test instances by evolving in instance space
- Integer sequence discovery from small graphs
- Automated conjecturing. III. Property-relations conjectures
- Conjecture of TxGraffiti: Independence, domination, and matchings
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
- Trees with given stability number and minimum number of stable sets
- A survey of automated conjectures in spectral graph theory
- House of graphs 2.0: a database of interesting graphs and more
This page was built for software: GraPHedron
