Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 3795986

From MaRDI portal
Publication:4740588
Jump to:navigation, search

zbMath0505.05033MaRDI QIDQ4740588

Ove Frank, Michael J. Plantholt, Frank Harary

Publication date: 1982


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completeforestsline-distinguishing chromatic number


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)


Related Items (15)

The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ 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\) ⋮ Graphs which have \(n/2\)-minimal line-distinguishing colourings ⋮ Harmonious coloring of trees with large maximum degree ⋮ Strongly set-colorable graphs ⋮ Harmonious colourings of graphs ⋮ The harmonious chromatic number of a complete binary and trinary tree ⋮ NP-completeness results for some problems on subclasses of bipartite and chordal graphs ⋮ On the harmonious chromatic number of a graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES ⋮ Some constructions of $\lambda$-minimal graphs







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4740588&oldid=18997346"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 21:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki