scientific article; zbMATH DE number 1057876

MaRDI QIDQ4352945zbMATH OpenFDO

Authors Keith Edwards

Publication date 2 March 1998

zbMATH Keywords

achromatic numberboundscolouringcomplexityharmonious chromatic number

Mathematics Subject Classification ID

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

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

Cited in

(36)

• The harmonious chromatic number of complete \(r\)-ary trees
• The achromatic number of bounded degree trees
• On the achromatic number of hypercubes
• The achromatic number of the union of cycles
• Achromatic number and facial achromatic number of connected locally-connected graphs
• Fine-grained complexity of rainbow coloring and its variants
• Complete acyclic colorings
• Complete colourings of hypergraphs
• The harmonious coloring problem is NP-complete for interval and permutation graphs
• Upward three-dimensional grid drawings of graphs
• Harmonious coloring: parameterized algorithms and upper bounds
• Generalization of achromatic colouring of central graphs
• Packing analogue of k-radius sequences
• Achromonious graphs
• scientific article; zbMATH DE number 994578 (Why is no real title available?)
• Harmonious coloring: parameterized algorithms and upper bounds
• Achromatic Number of K 5 × K n for Small n
• Connection Matrices for MSOL-Definable Structural Invariants
• Achromatic number of collections of paths and cycles
• Complete oriented colourings and the oriented achromatic number
• The growth rate of the harmonious chromatic number
• scientific article; zbMATH DE number 2104720 (Why is no real title available?)
• Fine-Grained Complexity of Rainbow Coloring and its Variants.
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Harmonious and achromatic colorings of fragmentable hypergraphs
• On the harmonious chromatic number of graphs
• On harmonious coloring of hypergraphs
• On the complexity of generalized chromatic polynomials
• Forbidden subgraphs and complete partitions
• The asymptotic existence of BIBDs having a nesting
• Banff designs: difference methods for coloring incidence graphs
• Approximate and exact results for the harmonious chromatic number
• The achromatic number of K₆ K_q equals 2q+3 if q41 is odd
• Some colouring problems for Paley graphs
• Complete partitions of graphs
• NP-completeness results for some problems on subclasses of bipartite and chordal graphs

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)