Precoloring extension on chordal graphs

MaRDI QIDQ3424784zbMATH OpenFDO

Authors Dániel Marx

Publication date 5 March 2007

zbMATH Keywords

coloringprecoloring extensionchordal graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Parameterized and Exact Computation
• Parameterized coloring problems on chordal graphs
• Precoloring Extension III: Classes of Perfect Graphs
• scientific article; zbMATH DE number 772747
• scientific article; zbMATH DE number 1033812

Cited in

(17)

• Precoloring extension. I: Interval graphs
• A technique for exact computation of precoloring extension on interval graphs
• Colouring, constraint satisfaction, and complexity
• The black-and-white coloring problem on chordal graphs
• Parameterized coloring problems on chordal graphs
• Parameterized and Exact Computation
• On the chromatic number of the preferential attachment graph
• Two-dimensional packing with conflicts
• \(b\)-coloring of tight graphs
• Precoloring Extension for 2‐connected Graphs
• Precoloring extension for 2-connected graphs with maximum degree three
• The \(d\)-precoloring problem for \(k\)-degenerate graphs
• Edge-b-coloring trees
• Precoloring extension forK₄-minor-free graphs
• Extending precolorings to circular colorings
• On the number of precolouring extensions
• \(B\)-coloring of \(m\)-tight graphs

This page was built for publication: Precoloring extension on chordal graphs

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