Automated generation of conjectures on forbidden subgraph characterization
type: Item
instance of: scholarly article
title: Automated generation of conjectures on forbidden subgraph characterization
zbMATH Open document ID: 1300.05268
author: Christian Desrosiers
author: P. Galinier
author: Pierre Hansen
author: Alain Hertz
published in: Discrete Applied Mathematics
publication date: 2014-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 6344082
zbMATH Keywords: forbidden subgraph characterization
zbMATH Keywords: automated conjecture generation
Wikidata QID: Q123314738
describes a project that uses: GRAFFITI
describes a project that uses: AutoGraphiX
MaRDI profile type: Publication
full work available at URL: j.dam.2013.07.013
OpenAlex ID: W2116753102
cites work: On domination and independent domination numbers of a graph
cites work: Every planar map is four colorable. II: Reducibility
cites work: Characterizations of derived graphs
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
cites work: The strong perfect graph theorem
cites work: On conjectures of Graffiti
cites work: Stability, domination and irredundance in a graph
cites work: Polynomial space polynomial delay algorithms for listing families of graphs
cites work: Q4071280
cites work: The splittance of a graph
cites work: Q5477963
cites work: Q4368728
cites work: Q3671211
cites work: Isomorph-Free Exhaustive Generation
cites work: Variable neighborhood search
cites work: Irredundance perfect andP6-free graphs
cites work: The four-colour theorem
cites work: Proof of a conjecture on irredundance perfect graphs
DOI: 10.1016/J.DAM.2013.07.013
description: scientific article; zbMATH DE number 6344082