scientific article; zbMATH DE number 3795986

MaRDI QIDQ4740588zbMATH OpenFDO

Authors Ove Frank, Frank Harary, Michael J. Plantholt

Publication date 1982

zbMATH Keywords

forestsline-distinguishing chromatic numberNP-complete

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(22)

• The complexity of harmonious colouring for trees
• The exact value of the harmonious chromatic number of a complete binary tree
• Asymptotic behaviour of the observability of \(Q_ n\)
• On the harmonious chromatic number of a graph
• Graphs which have n/2-minimal line-distinguishing colourings
• Harmonious coloring of trees with large maximum degree
• Some constructions of \lambda-minimal graphs
• Strongly set-colorable graphs
• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• Recursive axiomatisations from separation properties
• The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
• Harmonious colourings of graphs
• scientific article; zbMATH DE number 2230305 (Why is no real title available?)
• On the harmonious chromatic number of graphs
• Homological linear quotients and edge ideals of graphs
• The harmonious chromatic number of a complete binary and trinary tree
• The harmonious coloring game
• The asymptotic existence of BIBDs having a nesting
• A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
• Banff designs: difference methods for coloring incidence graphs
• Approximate and exact results for the harmonious chromatic number
• 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 Q4740588)