Scattered Classes of Graphs

DOI10.1137/19M1293776zbMath1436.05089arXiv1801.06004MaRDI QIDQ4959761

O-joung Kwon, Sang-il Oum

Publication date: 7 April 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.06004

zbMATH Keywords

subgraphgraph structurevertex-minor

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph minors (05C83)

Related Items

Graphs of bounded depth‐2 rank‐brittleness ⋮ Obstructions for bounded shrub-depth and rank-depth ⋮ The grid theorem for vertex-minors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Unavoidable vertex-minors in large prime graphs
• Excluded vertex-minors for graphs of linear rank-width at most \(k\)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese
• Clique-width of graphs defined by one-vertex extensions
• Isotropic systems
• Complement reducible graphs
• Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
• Algorithmic meta-theorems for restrictions of treewidth
• Unavoidable minors of large 3-connected binary matroids
• Obstructions for bounded shrub-depth and rank-depth
• The complexity of the vertex-minor problem
• The grid theorem for vertex-minors
• Rank-width: algorithmic and structural results
• Rank-width and vertex-minors
• On the relationship between NLC-width and linear NLC-width
• Parameterized Algorithms for Modular-Width
• Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
• Intersection Theorems for Systems of Sets
• Excluding a bipartite circle graph from line graphs
• Decomposition of Directed Graphs
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Matrices and matroids for systems analysis

This page was built for publication: Scattered Classes of Graphs