Vertex Coloring of Comparability+ke and –ke Graphs
From MaRDI portal
Publication:3522947
DOI10.1007/11917496_10zbMath1167.05318OpenAlexW1485395310MaRDI QIDQ3522947
Kenichi Higashide, Yasuhiko 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
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity ⋮ Unnamed Item ⋮ Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs ⋮ Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs ⋮ Subexponential parameterized algorithms and kernelization on almost chordal graphs ⋮ Open Problems on Graph Coloring for Special Graph Classes
This page was built for publication: Vertex Coloring of Comparability+ke and –ke Graphs