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.
- Title
- Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs
- Creators - without role
- Stéphan Thomassé - Laboratoire de l'Informatique du ParallélismeNicolas Bousquet - Algorithmes, Graphes et Combinatoire
- Publication Details
- Combinatorics, Probability and Computing, Vol.21, pp.512-514
- Identifiers
- 9947133809311
- Academic Unit
- Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
- Language
- English
- Resource Type
- Journal article
- Local Fields
- lirmm-00741917