Harmonious coloring on subclasses of colinear graphs
DOI10.1007/978-3-642-11440-3_13zbMATH Open1274.05163OpenAlexW1795039775MaRDI QIDQ3404436FDOQ3404436
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
Recommendations
complexitysplit graphsstrongly chordal graphsundirected path graphsharmonious coloringcolinear coloringcolinear graphs
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)
Cited In (9)
- 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
- Title not available (Why is that?)
- The complexity of harmonious colouring for trees
- Harmonious coloring: parameterized algorithms and upper bounds
- Title not available (Why is that?)
- On the harmonious coloring of collections of graphs
- Colinear Coloring on 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)