Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k

Authors: Kanté, Mamadou Moustapha, Kim, Eun Jung, Kwon, O-Joung, Oum, Sang-Il

Contributors: Mamadou Moustapha Kanté and Eun Jung Kim and O-joung Kwon and Sang-il Oum, Kanté, Mamadou, Berenbrink, Petra and Monmege, Benjamin

Source: Journal of Combinatorial Theory, Series B. 160:15-35

Subject Terms: Linear rank-width, path-width, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width matroid linear rank-width graph forbidden minor vertex-minor pivot-minor, 0102 computer and information sciences, 01 natural sciences, Graph, forbidden minor, FOS: Mathematics, Vertex-minor, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width, pivot-minor, Matroid, linear rank-width, Pivot-minor, graph, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Path-width, Combinatorics, vertex-minor, Forbidden minor, matroid, Combinatorics (math.CO), ddc:004, Recherche opérationnelle, 05B35 (Primary), 05C75 (Secondary)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2109.12291
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.40
https://hal.science/hal-04056695v1
https://doi.org/10.1016/j.jctb.2022.12.004
https://hal.science/hal-04056545v2/document
https://hal.science/hal-04056545v2
https://doi.org/10.4230/lipics.stacs.2022.40

Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k

Authors: Kim, Eun, Jung, Kwon, O-Joung, Oum, Sang-Il, Kanté, Mamadou Moustapha

Contributors: Department of Mathematics Incheon, Incheon National University, Department of Mathematical Sciences, KAIST, Korea Advanced Institute of Science and Technology (KAIST), Institute for Basic Science Daejeon (IBS), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Université Clermont Auvergne (UCA), Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Berenbrink, Petra and Monmege, Benjamin, ANR-18-CE40-0025,ASSK,Algorithmes avec décomposition moins connu: graphes et matroids(2018)

Source: STACS 2022 ; https://hal.science/hal-04056545 ; STACS 2022, Mar 2022, Marseille, France. ⟨10.4230/LIPIcs.STACS.2022.40⟩

Subject Terms: 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width matroid linear rank-width graph forbidden minor vertex-minor pivot-minor, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width, matroid, linear rank-width, graph, forbidden minor, vertex-minor, pivot-minor, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Subject Geographic: Marseille, France

Availability: https://hal.science/hal-04056545
https://hal.science/hal-04056545v2/document
https://hal.science/hal-04056545v2/file/LIPIcs-STACS-2022-40.pdf
https://doi.org/10.4230/LIPIcs.STACS.2022.40