The complexity of harmonious colouring for trees

DOI10.1016/0166-218X(94)00100-RzbMath0816.05026WikidataQ55966567 ScholiaQ55966567MaRDI QIDQ1346692

Keith J. Edwards, Colin J. H. McDiarmid

Publication date: 10 April 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

treecomplexityharmonious colouringnumber of colours

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (24)

Geometric achromatic and pseudoachromatic indices ⋮ Some notes on bounded starwidth graphs ⋮ Harmonious coloring: parameterized algorithms and upper bounds ⋮ Harmonious Coloring: Parameterized Algorithms and Upper Bounds ⋮ On the Pseudo-achromatic Number Problem ⋮ Evaluations of Graph Polynomials ⋮ On the Grundy number of Cameron graphs ⋮ Harmonious coloring of trees with large maximum degree ⋮ The Harmonious Chromatic Number of Bounded Degree Trees ⋮ Minimum order of graphs with given coloring parameters ⋮ Complete partitions of graphs ⋮ On the complexity of generalized chromatic polynomials ⋮ Harmonious colourings of graphs ⋮ Homomorphisms of 2-edge-colored graphs ⋮ Homomorphisms of 2-edge-colored graphs ⋮ Connection Matrices for MSOL-Definable Structural Invariants ⋮ Complete colourings of hypergraphs ⋮ VLSI layout of Benes networks ⋮ NP-completeness results for some problems on subclasses of bipartite and chordal graphs ⋮ On the pseudo-achromatic number problem ⋮ The achromatic number of bounded degree trees ⋮ The harmonious chromatic number of complete \(r\)-ary trees ⋮ Colored homomorphisms of colored mixed graphs ⋮ Counting Unlabelled Subtrees of a Tree is #P-complete

Cites Work

• Unnamed Item
• Unnamed Item
• On the Harmonious Coloring of Graphs
• New upper bounds on harmonious colorings

This page was built for publication: The complexity of harmonious colouring for trees