Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Combinatorics, Probability and Computing Year : 2012

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

Stéphan Thomassé
Nicolas Bousquet

Abstract

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 and versions

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

Identifiers

Cite

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⟩
117 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More