Trees are almost prime

DOI10.1016/J.DISC.2005.11.083zbMATH Open1115.05017OpenAlexW2094540371MaRDI QIDQ878641FDOQ878641

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

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

zbMATH Keywords

prime graphsEntringer's conjecture

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• On prime labellings
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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)