Recommendations
Cites work
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1545651 (Why is no real title available?)
- scientific article; zbMATH DE number 2151250 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- An algorithm for finding clique cut-sets
- Bi‐arc graphs and the complexity of list homomorphisms
- Coloring graphs with stable cutsets
- Complexity of graph partition problems
- Decomposition by clique separators
- Digraph matrix partitions and trigraph homomorphisms
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Full Constraint Satisfaction Problems
- LATIN 2004: Theoretical Informatics
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- List Partitions
- List homomorphisms and circular arc graphs
- Packing \(r\)-cliques in weighted chordal graphs
- Partitioning chordal graphs into independent sets and cliques
- Partitions of graphs into one or two independent sets and cliques
- Star-cutsets and perfect graphs
- The list partition problem for graphs
- Two algorithms for general list matrix partitions
Cited in
(35)- On Injective Colourings of Chordal Graphs
- List homomorphism: beyond the known boundaries
- Matrix partitions of perfect graphs
- Partitions and well-coveredness: the graph sandwich problem
- On realizations of point determining graphs, and obstructions to full homomorphisms
- On the complexity of coloring ‐graphs
- Graph partitions with prescribed patterns
- Join colourings of chordal graphs
- scientific article; zbMATH DE number 7525468 (Why is no real title available?)
- List matrix partitions of graphs representing geometric configurations
- Colouring, constraint satisfaction, and complexity
- On the probe problem for \((r,\ell )\)-well-coveredness
- Complexity of \(C_k\)-coloring in hereditary classes of graphs
- Matrix Partitions with Finitely Many Obstructions
- The complexity of list edge-partitions for simple graphs
- The external constraint 4 nonempty part sandwich problem
- Well-partitioned chordal graphs
- On 2-Subcolourings of Chordal Graphs
- On the thinness and proper thinness of a graph
- Polarity of chordal graphs
- \(2K_{2}\) vertex-set partition into nonempty parts
- Counting List Matrix Partitions of Graphs
- Almost all friendly matrices have many obstructions
- Dichotomy for tree-structured trigraph list homomorphism problems
- Partitioning chordal graphs into independent sets and cliques
- Digraph matrix partitions and trigraph homomorphisms
- 2K2 vertex-set partition into nonempty parts
- On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
- Matrix partitions of split graphs
- Obstructions to partitions of chordal graphs
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
- Chordal multipartite graphs and chordal colorings
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- LATIN 2004: Theoretical Informatics
- Minimal obstructions for a matrix partition problem in chordal graphs
This page was built for publication: List matrix partitions of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817772)
