Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Article Dans Une Revue Combinatorics, Probability and Computing Année : 2012

Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs

Stéphan Thomassé
Nicolas Bousquet

Résumé

Scott conjectured in [6] that the class of graphs with no induced subdivision of a given graph is χ-bounded. We verify his conjecture for maximal triangle-free graphs.

Dates et versions

lirmm-00741917 , version 1 (15-10-2012)

Identifiants

Citer

Stéphan Thomassé, Nicolas Bousquet. Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Combinatorics, Probability and Computing, 2012, 21, pp.512-514. ⟨10.1017/S0963548312000065⟩. ⟨lirmm-00741917⟩
127 Consultations
0 Téléchargements

Altmetric

Partager

More