Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
classification
🧮 math.CO
keywords
bipartitedegreeleastminimumplanarpropereverygraph
read the original abstract
We show that every bipartite planar graph with minimum degree at least 3 has proper orientation number at most 3.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.