On 2-Subcolourings of Chordal Graphs

DOI10.1007/978-3-540-78773-0_47MaRDI QIDQ5458558zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• 2-tone coloring of chordal and outerplanar graphs
• scientific article; zbMATH DE number 1002208
• scientific article; zbMATH DE number 742642
• Subcolorings and the subchromatic number of a graph
• scientific article; zbMATH DE number 52166
• Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs
• Chromatic bounds for the subclasses of pK₂-free graphs
• Chordal multipartite graphs and chordal colorings
• On 2-colorings of hypergraphs
• On the chromatic number of a graph with two forbidden subgraphs

Cites work

• Efficient graph representations
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 2044932 (Why is no real title available?)
• List matrix partitions of chordal graphs
• More about subcolorings
• Partitioning chordal graphs into independent sets and cliques
• Subcolorings and the subchromatic number of a graph
• The complexity of \(G\)-free colourability
• The subchromatic number of a graph

Cited in

(13)

• The maximum k-colorable subgraph problem for chordal graphs
• Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
• Largest chordal and interval subgraphs faster than \(2^n\)
• scientific article; zbMATH DE number 52166 (Why is no real title available?)
• scientific article; zbMATH DE number 1953083 (Why is no real title available?)
• On efficient coloring of chordless graphs
• Solving partition problems almost always requires pushing many vertices around
• Solving partition problems almost always requires pushing many vertices around
• Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
• Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
• Thick forests
• Title not available (Why is no real title available?)
• Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458558)