On 2-Subcolourings of Chordal Graphs

DOI10.1007/978-3-540-78773-0_47zbMath1136.68470OpenAlexW1493037708MaRDI QIDQ5458558

Juraj Stacho

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs ⋮ Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract) ⋮ Unnamed Item ⋮ Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

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

This page was built for publication: On 2-Subcolourings of Chordal Graphs