Harmonious coloring: parameterized algorithms and upper bounds

DOI10.1007/978-3-662-53536-3_21MaRDI QIDQ3181062zbMATH OpenOpenAlexFDO

Authors Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale

Publication date 22 December 2016

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

Full work available at URL https://doi.org/10.1007/978-3-662-53536-3_21

Mathematics Subject Classification ID

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

Recommendations

• Harmonious coloring: parameterized algorithms and upper bounds
• Harmonious coloring on subclasses of colinear graphs
• Bounds for the harmonious chromatic number of a graph
• An upper bound for the harmonious chromatic number of a graph
• The Harmonious Chromatic Number of Bounded Degree Trees

Cites work

• A note on the complexity of the chromatic number problem
• Achromatic number is NP-complete for cographs and interval graphs
• B-chromatic number: beyond NP-hardness
• Every planar map is four colorable. I: Discharging
• Graph with given achromatic number
• Harmonious coloring on subclasses of colinear graphs
• scientific article; zbMATH DE number 1057876 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• NP-completeness results for some problems on subclasses of bipartite and chordal graphs
• On harmonious colouring of trees
• On the Harmonious Coloring of Graphs
• On the pseudo-achromatic number problem
• Parameterized algorithms
• Set partitioning via inclusion-exclusion
• The complexity of harmonious colouring for trees
• The Harmonious Chromatic Number of Bounded Degree Trees
• The harmonious coloring number of a graph
• The harmonious coloring problem is NP-complete for interval and permutation graphs

Cited in

(2)

• Harmonious coloring: parameterized algorithms and upper bounds
• Harmonious coloring on subclasses of colinear graphs

This page was built for publication: Harmonious coloring: parameterized algorithms and upper bounds

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