The following pages link to (Q3672040):
Displaying 8 items.
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- Spectra of unicyclic graphs (Q1091400) (← links)
- Man-machine theorem proving in graph theory (Q1104124) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- When can the components of NEPS of connected bipartite graphs be almost cospectral? (Q1567543) (← links)
- On the components of NEPS of connected bipartite graphs (Q1855388) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- A few examples and counterexamples in spectral graph theory (Q2296012) (← links)
