scientific article; zbMATH DE number 3795986

zbMATH Open0505.05033MaRDI QIDQ4740588FDOQ4740588

Authors: Ove Frank, Frank Harary, Michael J. Plantholt 

Publication date: 1982

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

zbMATH Keywords

forestsNP-completeline-distinguishing chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (17)

• NP-completeness results for some problems on subclasses of bipartite and chordal graphs
• The harmonious chromatic number of a complete binary and trinary tree
• Graphs which have \(n/2\)-minimal line-distinguishing colourings
• On the harmonious chromatic number of graphs
• Harmonious coloring of trees with large maximum degree
• On the harmonious chromatic number of a graph
• The exact value of the harmonious chromatic number of a complete binary tree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some constructions of $\lambda$-minimal graphs
• The complexity of harmonious colouring for trees
• Recursive axiomatisations from separation properties
• The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
• Homological linear quotients and edge ideals of graphs
• Strongly set-colorable graphs
• Harmonious colourings of graphs
• Asymptotic behaviour of the observability of \(Q_ n\)

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)