Automated generation of conjectures on forbidden subgraph characterization
From MaRDI portal
Publication:741737
DOI10.1016/j.dam.2013.07.013zbMath1300.05268OpenAlexW2116753102WikidataQ123314738 ScholiaQ123314738MaRDI QIDQ741737
Pierre Hansen, Philippe Galinier, Christian Desrosiers, Alain Hertz
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.07.013
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On domination and independent domination numbers of a graph
- The strong perfect graph theorem
- On conjectures of Graffiti
- The splittance of a graph
- Every planar map is four colorable. II: Reducibility
- The four-colour theorem
- Variable neighborhood search
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Stability, domination and irredundance in a graph
- Irredundance perfect andP6-free graphs
- Isomorph-Free Exhaustive Generation
- Proof of a conjecture on irredundance perfect graphs
- Polynomial space polynomial delay algorithms for listing families of graphs
- Characterizations of derived graphs
