Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
Abstract
We show that every bipartite planar graph with minimum degree at least 3 has proper orientation number at most 3.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.