Partitioning graphs into induced subgraphs
DOI10.1016/j.dam.2019.01.010zbMath1429.05166arXiv1508.04725OpenAlexW3022092465MaRDI QIDQ2283104
Publication date: 30 December 2019
Published in: Discrete Applied Mathematics, Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.04725
graph partitioninggraph matchingparameterized complexityparametrized complexitydense graphsgeneralized matching
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded vertex colorings of graphs
- Elements of finite model theory.
- Equitable colorings of bounded treewidth graphs
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- On problems without polynomial kernels
- An application of simultaneous diophantine approximation in combinatorial optimization
- Algorithmic meta-theorems for restrictions of treewidth
- Partitioning graphs into induced subgraphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Parameterized Algorithms for Modular-Width
- Integer Programming with a Fixed Number of Variables
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
- Star Partitions of Perfect Graphs
- Paths, Trees, and Flowers
- On the completeness of a generalized matching problem
- Parameterized Algorithms
- The Factorization of Linear Graphs
- Bounded vertex coloring of trees
This page was built for publication: Partitioning graphs into induced subgraphs
