Trees are almost prime

DOI10.1016/J.DISC.2005.11.083MaRDI QIDQ878641zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1874445
• Primality of trees
• On Newman's Conjecture and Prime Trees
• Prime Labelings
• On prime labelings of Fibonacci trees

Cites work

• scientific article; zbMATH DE number 1874445 (Why is no real title available?)
• scientific article; zbMATH DE number 1416061 (Why is no real title available?)
• On prime labellings

Cited in

(7)

• Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)
• Minimum coprime graph labelings
• Minimum coprime labelings for operations on graphs
• Prime labelings of infinite graphs
• Primality of trees
• True trees are dense
• A few logs suffice to build (almost) all trees. II

This page was built for publication: Trees are almost prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878641)