English

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

Combinatorics 2026-04-24 v1

Abstract

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

Keywords

Cite

@article{arxiv.1904.00563,
  title  = {Proper 3-orientations of bipartite planar graphs with minimum degree at least 3},
  author = {Kenta Noguchi},
  journal= {arXiv preprint arXiv:1904.00563},
  year   = {2026}
}

Comments

4 pages, 2 figures