Pages that link to "Item:Q944740"

The following pages link to Facet defining inequalities among graph invariants: The system graphedron (Q944740):

Displaying 18 items.

• Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
• Towards objective measures of algorithm performance across instance space (Q336954) (← links)
• Generating new test instances by evolving in instance space (Q342041) (← links)
• Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
• Integer sequence discovery from small graphs (Q908306) (← links)
• A survey of automated conjectures in spectral graph theory (Q962119) (← links)
• Connected vertex covers in dense graphs (Q974753) (← links)
• Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
• GrInvIn in a nutshell (Q1029769) (← links)
• Fibonacci index and stability number of graphs: a polyhedral study (Q1041432) (← links)
• A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
• Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
• Trees with given stability number and minimum number of stable sets (Q1926055) (← links)
• House of graphs 2.0: a database of interesting graphs and more (Q2104929) (← links)
• Upper bounding rainbow connection number by forest number (Q2138952) (← links)
• Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph (Q6046133) (← links)
• The stochastic pseudo-star degree centrality problem (Q6112539) (← links)