Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 1161313 (Why is no real title available?)
- scientific article; zbMATH DE number 1545651 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- Algorithms for partition of some class of graphs under compaction
- Bounded Tree-Width and CSP-Related Problems
- Colouring, constraint satisfaction, and complexity
- Computational Complexity of Compaction to Reflexive Cycles
- Decomposition by clique separators
- Digraph matrix partitions and trigraph homomorphisms
- Fast Skew Partition Recognition
- FindingH-partitions efficiently
- Full Constraint Satisfaction Problems
- Homomorphism preservation theorems
- Induced subgraphs and well‐quasi‐ordering
- List Partitions
- List matrix partitions of chordal graphs
- Matrix partitions of perfect graphs
- Matrix partitions with finitely many obstructions
- On digraph coloring problems and treewidth duality
- On realizations of point determining graphs, and obstructions to full homomorphisms
- Partitioning chordal graphs
- Partitioning chordal graphs into independent sets and cliques
- Star-cutsets and perfect graphs
- The Complexity of the List Partition Problem for Graphs
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn List partition problem
Cited in
(14)- Matrix partitions with finitely many obstructions
- Matrix partitions of perfect graphs
- Graph partitions with prescribed patterns
- Join colourings of chordal graphs
- The monotonicity property of \(M\)-partition problems
- Matrix Partitions with Finitely Many Obstructions
- scientific article; zbMATH DE number 1189243 (Why is no real title available?)
- Almost all friendly matrices have many obstructions
- Generalized colouring (matrix partitions) of cographs
- Matrix partitions of split graphs
- Obstructions to a general characterization of graph correspondences
- Minimal obstructions for a matrix partition problem in chordal graphs
- List matrix partitions of chordal graphs
- Bad News for Chordal Partitions
This page was built for publication: Obstructions to partitions of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383740)
