Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)

DOI10.1007/s00373-018-1980-yzbMath1407.05209OpenAlexW2903132592MaRDI QIDQ1733859

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

zbMATH Keywords

bipartite graphregular graphprime labeling

Mathematics Subject Classification ID

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

Related Items (2)

Correction to: ``Every cubic bipartite graph has a prime labeling except \(K_{3,3}\) ⋮ Hamiltonicity of a coprime graph

Uses Software

• OEIS

Cites Work

• Prime labelings of generalized Petersen graphs
• Primality of trees
• Trees are almost prime
• Prime labeling of graphs
• A dynamic survey of graph labeling
• Approximate formulas for some functions of prime numbers
• Some Results on Prime and k-Prime Labeling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)