Every cubic bipartite graph has a prime labeling except K₃,3

DOI10.1007/S00373-018-1980-YzbMATH Open1407.05209OpenAlexW2903132592MaRDI QIDQ1733859FDOQ1733859

Authors: Justin Z. Schroeder 

Publication date: 21 March 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1980-y

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

zbMATH Keywords

bipartite graphregular graphprime labeling

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• A dynamic survey of graph labeling
• Approximate formulas for some functions of prime numbers
• Prime labelings of generalized Petersen graphs
• Primality of trees
• Trees are almost prime
• Title not available (Why is that?)
• Prime labeling of graphs
• Title not available (Why is that?)
• Prime cordial labeling of generalized prism graph \(Y_{m,n}\)
• Title not available (Why is that?)
• Some results on prime and \(k\)-prime labeling
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Prime-magic labelings of \(K_{n,n}\)
• \(mK_{2,3}\) is vertex prime
• Hamiltonicity of a coprime graph
• Correction to: ``Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)

Uses Software

• OEIS

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)