Harmonious coloring on subclasses of colinear graphs

DOI10.1007/978-3-642-11440-3_13MaRDI QIDQ3404436zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The harmonious coloring problem is NP-complete for interval and permutation graphs
• On the Harmonious Coloring of Graphs
• The complexity of harmonious colouring for trees
• Harmonious coloring: parameterized algorithms and upper bounds
• Harmonious coloring: parameterized algorithms and upper bounds

Cited in

(9)

• Colinear Coloring on Graphs
• On the Harmonious Coloring of Graphs
• The harmonious coloring problem is NP-complete for interval and permutation graphs
• Harmonious coloring: parameterized algorithms and upper bounds
• scientific article; zbMATH DE number 5619926 (Why is no real title available?)
• The complexity of harmonious colouring for trees
• Harmonious coloring: parameterized algorithms and upper bounds
• scientific article; zbMATH DE number 6124450 (Why is no real title available?)
• On the harmonious coloring of collections of graphs

This page was built for publication: Harmonious coloring on subclasses of colinear graphs

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