INGRID
From MaRDI portal
Cited in
(23)- Computers and discovery in algebraic graph theory
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Sharp bounds on the order, size, and stability number of graphs
- A knowledge-based system for graph theory demonstrated by partial proofs for graph-colouring problems
- Bounds and conjectures for the signless Laplacian index of graphs
- scientific article; zbMATH DE number 1303259 (Why is no real title available?)
- MOLGEN
- GrInvIn
- AutoGraphiX
- GRAFFITI
- HR
- Grappa
- GRAPH
- GraPHedron
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- INGRID: A graph invariant manipulator
- A compilation of relations between graph invariants—supplement I
- scientific article; zbMATH DE number 812088 (Why is no real title available?)
- What forms do interesting conjectures have in graph theory?
- Automated conjecturing. III. Property-relations conjectures
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- Upper bounds on the edge clique cover number of a graph
- A survey of automated conjectures in spectral graph theory
This page was built for software: INGRID
