The following pages link to (Q3318779):
Displaying 10 items.
- INGRID (Q13815) (← links)
- Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- INGRID: A graph invariant manipulator (Q1113914) (← links)
- On the size of graphs of a given bandwidth (Q1121919) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
