Pages that link to "Item:Q3548730"

The following pages link to Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730):

Displaying 10 items.

• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
• Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
• A survey of automated conjectures in spectral graph theory (Q962119) (← links)
• The minimum spectral radius of graphs with a given independence number (Q1030756) (← links)
• Fibonacci index and stability number of graphs: a polyhedral study (Q1041432) (← links)
• Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
• The size of graphs with given feedback vertex number (Q2127624) (← links)
• Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
• ON THE SUM OF INDEPENDENCE NUMBER AND AVERAGE DEGREE OF A GRAPH (Q3087090) (← links)
• Turán Graphs, Stability Number, and Fibonacci Index (Q5505651) (← links)