The following pages link to INGRID (Q13815):
Displaying 15 items.
- Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Bounds and conjectures for the signless Laplacian index of graphs (Q968999) (← links)
- INGRID: A graph invariant manipulator (Q1113914) (← 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)
- (Q3510977) (← links)
- Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
- A compilation of relations between graph invariants—supplement I (Q3977270) (← links)
- (Q4249792) (← links)
- (Q4853762) (← links)
- Sharp bounds on the order, size, and stability number of graphs (Q5287443) (← links)
- (Q5477963) (← links)
