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

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

Stéphan Thomassé
Algorithmes, Graphes et Combinatoire
Nicolas Bousquet
Algorithmes, Graphes et Combinatoire

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.

Domains

Discrete Mathematics [cs.DM]

Nicolas Bousquet  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00741917

Submitted on : Monday, October 15, 2012-3:01:26 PM

Last modification on : Friday, March 24, 2023-2:52:56 PM

Consult the full text

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER
122 View
0 Download

Altmetric

Share

More