GraPHedron
From MaRDI portal
Software:36871
No author found.
Related Items (19)
Unnamed Item ⋮ 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\) ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Integer sequence discovery from small graphs ⋮ Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ 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 ⋮ Fibonacci index and stability number of graphs: a polyhedral study ⋮ House of graphs 2.0: a database of interesting graphs and more ⋮ Counting the number of non-equivalent vertex colorings of a graph
This page was built for software: GraPHedron
