The following pages link to (Q3197866):
Displaying 9 items.
- Graphs with the strong Havel-Hakimi property (Q343704) (← links)
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
