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

Primality of trees

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

DOI10.4310/JOC.2011.v2.n4.a1zbMath1269.05096OpenAlexW2058073416MaRDI QIDQ357453

Penny E. Haxell, Oleg Pikhurko, Anusch Taraz

Publication date: 30 July 2013

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2011.v2.n4.a1


zbMATH Keywords

coprime graphEntringer-Tout conjectureprime labeling


Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)


Related Items (11)

Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds ⋮ Unnamed Item ⋮ Coprime index of a graph ⋮ Prime labelings of infinite graphs ⋮ Unnamed Item ⋮ Every cubic bipartite graph has a prime labeling except \(K_{3,3}\) ⋮ On prime labelings of Fibonacci trees ⋮ Unnamed Item ⋮ Minimum coprime graph labelings ⋮ Hamiltonicity of a coprime graph ⋮ Unnamed Item




This page was built for publication: Primality of trees

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