Vertex Coloring of Comparability+ke and –ke Graphs

DOI10.1007/11917496_10MaRDI QIDQ3522947zbMATH OpenOpenAlexFDO

Authors Kenichi Higashide, Y. Takenaga

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11917496_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Parameterized complexity of vertex colouring
• Vertex coloring of graphs with few obstructions
• Two complexity results for the vertex coloring problem
• The complexity of changing colourings with bounded maximum degree
• Polynomial cases for the vertex coloring problem

Cited in

(7)

• Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
• scientific article; zbMATH DE number 7651188 (Why is no real title available?)
• Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
• Subexponential parameterized algorithms and kernelization on almost chordal graphs
• Open problems on graph coloring for special graph classes
• Parameterized complexity of vertex colouring
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs

This page was built for publication: Vertex Coloring of Comparability+ke and –ke Graphs

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