Every cubic bipartite graph has a prime labeling except K₃,3
From MaRDI portal
Publication:1733859
Recommendations
- Prime labelings of bipartite generalized Petersen graphs and other prime cubic bipartite graphs
- On prime labellings
- On the prime labeling of generalized Petersen graphs \(P(n,3)\)
- A 2-regular graph has a prime labeling if and only if it has at most one odd component
- Prime labeling of some special class of graphs
Cites work
- scientific article; zbMATH DE number 1156646 (Why is no real title available?)
- scientific article; zbMATH DE number 1874445 (Why is no real title available?)
- scientific article; zbMATH DE number 867700 (Why is no real title available?)
- scientific article; zbMATH DE number 6260109 (Why is no real title available?)
- A dynamic survey of graph labeling
- Approximate formulas for some functions of prime numbers
- Graph theory
- Primality of trees
- Prime cordial labeling of generalized prism graph \(Y_{m,n}\)
- Prime labeling of graphs
- Prime labelings of bipartite generalized Petersen graphs and other prime cubic bipartite graphs
- Prime labelings of generalized Petersen graphs
- Some results on prime and \(k\)-prime labeling
- Trees are almost prime
Cited in
(7)- Prime labelings of bipartite generalized Petersen graphs and other prime cubic bipartite graphs
- Prime-magic labelings of \(K_{n,n}\)
- \(mK_{2,3}\) is vertex prime
- A 2-regular graph has a prime labeling if and only if it has at most one odd component
- A note on prime labeling \(k\)-partite \(k\)-graphs
- Hamiltonicity of a coprime graph
- Correction to: ``Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)
This page was built for publication: Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733859)
