Harmonious Coloring on Subclasses of Colinear Graphs

DOI10.1007/978-3-642-11440-3_13zbMath1274.05163OpenAlexW1795039775MaRDI QIDQ3404436

Kyriaki Ioannidou, Stavros D. Nikolopoulos

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_13

zbMATH Keywords

complexitysplit graphsstrongly chordal graphsundirected path graphsharmonious coloringcolinear coloringcolinear graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Harmonious coloring: parameterized algorithms and upper bounds ⋮ Harmonious Coloring: Parameterized Algorithms and Upper Bounds

This page was built for publication: Harmonious Coloring on Subclasses of Colinear Graphs