Trees are almost prime

DOI10.1016/j.disc.2005.11.083zbMath1115.05017OpenAlexW2094540371MaRDI QIDQ878641

Oleg Pikhurko

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.083

zbMATH Keywords

prime graphsEntringer's conjecture

Mathematics Subject Classification ID

Trees (05C05)

Related Items (4)

Prime labelings of infinite graphs ⋮ Every cubic bipartite graph has a prime labeling except \(K_{3,3}\) ⋮ Minimum Coprime Labelings for Operations on Graphs ⋮ Minimum coprime graph labelings

Cites Work

• On prime labellings
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees are almost prime