Harmonious Coloring: Parameterized Algorithms and Upper Bounds
From MaRDI portal
Publication:3181062
DOI10.1007/978-3-662-53536-3_21zbMath1417.05220OpenAlexW2525811450MaRDI QIDQ3181062
Fahad Panolan, Prafullkumar Tale, Ragukumar Pandurangan, Sudeshna Kolay, Venkatesh Raman
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
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- On harmonious colouring of trees
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- On the pseudo-achromatic number problem
- The harmonious coloring number of a graph
- A note on the complexity of the chromatic number problem
- Graph with given achromatic number
- Every planar map is four colorable. I: Discharging
- The complexity of harmonious colouring for trees
- Achromatic number is NP-complete for cographs and interval graphs
- The harmonious coloring problem is NP-complete for interval and permutation graphs
- Integer Programming with a Fixed Number of Variables
- On the Harmonious Coloring of Graphs
- Harmonious Coloring on Subclasses of Colinear Graphs
- Set Partitioning via Inclusion-Exclusion
- Minkowski's Convex Body Theorem and Integer Programming
- The Harmonious Chromatic Number of Bounded Degree Trees
- B-chromatic number: Beyond NP-hardness
- Parameterized Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Harmonious Coloring: Parameterized Algorithms and Upper Bounds