Cited in
(37)- Conjectures of TxGraffiti: independence, domination, and matchings
- Counting the number of non-equivalent vertex colorings of a graph
- Improved approximation bounds for edge dominating set in dense graphs
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- 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
- Upper bounding rainbow connection number by forest number
- scientific article; zbMATH DE number 5255703 (Why is no real title available?)
- INGRID
- MyPYTHIA
- GrInvIn
- AutoGraphiX
- House of Graphs
- Graffiti.pc
- GRAFFITI
- HR
- GAUSS
- GRAPH
- CaGe
- GWT
- GENREG
- snarkhunter
- Triangleramsey
- Gavrog
- GRADPART
- Systre
- 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
- 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
