Partitioning chordal graphs
From MaRDI portal
Publication:2857366
zbMATH Open1274.05376MaRDI QIDQ2857366FDOQ2857366
Pavol Hell, TomΓ‘s Feder, Shekoofeh Nekooei Rizi
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001223
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (9)
- Title not available (Why is that?)
- Graph partitions with prescribed patterns
- Partitioning a graph into cycles with a specified number of chords
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- Title not available (Why is that?)
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- Obstructions to partitions of chordal graphs
- LATIN 2004: Theoretical Informatics
- Bad News for Chordal Partitions
Recommendations
- Title not available (Why is that?) π π
- Well-partitioned chordal graphs π π
- Vertex partitions of chordal graphs π π
- Title not available (Why is that?) π π
- Clique Partitions of Chordal Graphs π π
- Partitioning chordal graphs into independent sets and cliques π π
- Partitioning chordal graphs into independent sets and cliques π π
- Partitioning a graph into cycles with a specified number of chords π π
- LATIN 2004: Theoretical Informatics π π
- Title not available (Why is that?) π π
This page was built for publication: Partitioning chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857366)