Proper 3-orientations of bipartite planar graphs with minimum degree at\n least 3

2019/01/01 by Kenta Noguchi, Noguchi, Kenta · 1 citation
Computer Science · Engineering · #05C15 #05C20 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1904.00563

openalex publication_date 2019/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that every bipartite planar graph with minimum degree at least 3 has\nproper orientation number at most 3.\n

Cited by

• Proper orientations and proper chromatic number

Related

• Proper Orientations of Planar Bipartite Graphs
• Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs
• Proper orientations and proper chromatic number
• On the proper orientation number of chordal graphs
• On the In-Out-Proper Orientations of Graphs