Well-quasi-ordering $H$-contraction-free graphs

Marcin Jakub Kamiński (1) , Jean-Florent Raymond (2, 1) , Théophile Trunck (3)

1 MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
2 ALGCO - Algorithmes, Graphes et Combinatoire
3 LIP - Laboratoire de l'Informatique du Parallélisme

A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined by excluding one graph as contraction. More precisely, we give a complete characterization of graphs H such that the class of H-contraction-free graphs is well-quasi-ordered by the contraction relation. This result is the contraction analogue on the previous dichotomy theorems of Damsaschke [Induced subgraphs and well-quasi-ordering, Journal of Graph Theory, 14(4):427-435, 1990] on the induced subgraph relation, Ding [Subgraphs and well-quasi-ordering, Journal of Graph Theory, 16(5):489-502, 1992] on the subgraph relation, and B{\l}asiok et al. [Induced minors and well-quasi-ordering, ArXiv e-prints, 1510.07135, 2015] on the induced minor relation.

Keywords: Well-quasi-ordering; Edge contraction; Forbidden contractions

Domains: Combinatorics [math.CO]; Discrete Mathematics [cs.DM]

Marcin Jakub Kamiński, Jean-Florent Raymond, Théophile Trunck. Well-quasi-ordering $H$-contraction-free graphs. Discrete Applied Mathematics, 2017, In press. ⟨10.1016/j.dam.2017.02.018⟩. ⟨lirmm-01486775v1⟩