Automated generation of conjectures on forbidden subgraph characterization
From MaRDI portal
Recommendations
- AutoGraphiX: an automated system for finding conjectures in graph theory
- How far is, should and could be conjecture-making in graph theory an automated process?
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- What forms do interesting conjectures have in graph theory?
- Automated conjecturing. III. Property-relations conjectures
Cites work
- Characterizations of derived graphs
- Every planar map is four colorable. II: Reducibility
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 3487498 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Irredundance perfect andP6-free graphs
- Isomorph-Free Exhaustive Generation
- On conjectures of Graffiti
- On domination and independent domination numbers of a graph
- Polynomial space polynomial delay algorithms for listing families of graphs
- Proof of a conjecture on irredundance perfect graphs
- Stability, domination and irredundance in a graph
- The four-colour theorem
- The splittance of a graph
- The strong perfect graph theorem
- Variable neighborhood search
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- What forms do interesting conjectures have in graph theory?
This page was built for publication: Automated generation of conjectures on forbidden subgraph characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741737)
