\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs

DOI10.1137/21m1443534arXiv2101.08881MaRDI QIDQ6188517

Lalla Mouatadid, Unnamed Author, Mengchuan Zou, Eric Sopena

Publication date: 7 February 2024

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

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

zbMATH Keywords

modular decompositiongraph decompositionpartitive setstwin-width\((\alpha,\beta)\)-modulegeneralization of modules

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree-representation of set families and applications to combinatorial decompositions
• A survey of the algorithmic aspects of modular decomposition
• Ramsey-type theorems
• Approximating modular decomposition is hard
• Almost all comparability graphs are UPO
• A complete complexity classification of the role assignment problem
• Algorithms solving the matching cut problem
• Theory of 2-structures. II: Representation through labeled tree families
• Matching cutsets in graphs of diameter 2
• Algorithmic aspects of a general modular decomposition theory
• Decomposition of perfect graphs
• Complement reducible graphs
• Partitive hypergraphs
• Submodular functions and optimization
• The structure of median graphs
• Recognizing median graphs in subquadratic time
• A \(k\)-structure generalization of the theory of 2-structures
• Forbidden subgraph decomposition
• On the Erdős-Hajnal conjecture for six-vertex tournaments
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• On a property of the class of n-colorable graphs
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
• Recognizing decomposable graphs
• The complexity of the matching-cut problem for planar graphs and other graph classes
• A Combinatorial Decomposition Theory
• On sets of integers containing k elements in arithmetic progression
• Theory of 2-structures
• Twin-width I: Tractable FO Model Checking
• Matching cutsets in graphs
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
• Drawing graphs using modular decomposition
• Transitiv orientierbare Graphen
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS

This page was built for publication: \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs