On the Harmonious Coloring of Graphs
From MaRDI portal
Publication:3331240
DOI10.1137/0604032zbMath0543.05028OpenAlexW1974410371MaRDI QIDQ3331240
John E. Hopcrofts, Mukkai S. Krishnamoorthy
Publication date: 1983
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0604032
Complexity of computation (including implicit computational complexity) (03D15) Coloring of graphs and hypergraphs (05C15)
Related Items (25)
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ Harmonious coloring: parameterized algorithms and upper bounds ⋮ The complexity of harmonious colouring for trees ⋮ Harmonious Coloring: Parameterized Algorithms and Upper Bounds ⋮ Super total graceful graphs ⋮ The exact value of the harmonious chromatic number of a complete binary tree ⋮ The Harmonious Chromatic Number of Almost All Trees ⋮ Colouring a dominating set without conflicts: \(q\)-subset square colouring ⋮ Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants ⋮ Harmonious coloring of trees with large maximum degree ⋮ Strongly set-colorable graphs ⋮ The Harmonious Chromatic Number of Bounded Degree Trees ⋮ The harmonious coloring number of a graph ⋮ On the complexity of generalized chromatic polynomials ⋮ Harmonious colourings of graphs ⋮ The harmonious chromatic number of a complete binary and trinary tree ⋮ Connection Matrices for MSOL-Definable Structural Invariants ⋮ NP-completeness results for some problems on subclasses of bipartite and chordal graphs ⋮ Three algorithms for graph locally harmonious colouring ⋮ Set colorings of graphs ⋮ On the harmonious chromatic number of a graph ⋮ Unnamed Item ⋮ Central Graph of Quadrilateral Snakes with Chromatic Number ⋮ Coloring a dominating set without conflicts: \(q\)-subset square coloring ⋮ RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES
Cites Work
This page was built for publication: On the Harmonious Coloring of Graphs
