On 2-Subcolourings of Chordal Graphs
From MaRDI portal
Publication:5458558
DOI10.1007/978-3-540-78773-0_47zbMath1136.68470MaRDI QIDQ5458558
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_47
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- More about subcolorings
- List matrix partitions of chordal graphs
- The complexity of \(G\)-free colourability
- Efficient graph representations
- Subcolorings and the subchromatic number of a graph
- The subchromatic number of a graph
- Partitioning chordal graphs into independent sets and cliques