scientific article; zbMATH DE number 1057876

zbMATH Open0882.05062MaRDI QIDQ4352945FDOQ4352945

Authors: Keith Edwards 

Publication date: 2 March 1998

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 125470
• A new upper bound for the harmonious chromatic number
• Bounds for the harmonious chromatic number of a graph

zbMATH Keywords

complexityboundscolouringachromatic numberharmonious chromatic number

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Cited In (30)

• NP-completeness results for some problems on subclasses of bipartite and chordal graphs
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Complete oriented colourings and the oriented achromatic number
• On the harmonious chromatic number of graphs
• The harmonious chromatic number of complete \(r\)-ary trees
• The achromatic number of bounded degree trees
• Complete partitions of graphs
• The harmonious coloring problem is NP-complete for interval and permutation graphs
• Some colouring problems for Paley graphs
• The achromatic number of the union of cycles
• Packing analogue of \(k\)-radius sequences
• On harmonious coloring of hypergraphs
• Harmonious coloring: parameterized algorithms and upper bounds
• Harmonious and achromatic colorings of fragmentable hypergraphs
• On the achromatic number of hypercubes
• Achromatic number and facial achromatic number of connected locally-connected graphs
• Complete colourings of hypergraphs
• Fine-Grained Complexity of Rainbow Coloring and its Variants.
• The growth rate of the harmonious chromatic number
• Upward three-dimensional grid drawings of graphs
• Harmonious coloring: parameterized algorithms and upper bounds
• Title not available (Why is that?)
• Achromatic Number of K 5 × K n for Small n
• Generalization of achromatic colouring of central graphs
• Complete acyclic colorings
• Achromatic number of collections of paths and cycles
• Achromonious graphs
• Connection Matrices for MSOL-Definable Structural Invariants
• Fine-grained complexity of rainbow coloring and its variants
• On the complexity of generalized chromatic polynomials

This page was built for publication:

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