Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2019
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917430006120448 |
|---|---|
| author | Noguchi, Kenta |
| author_facet | Noguchi, Kenta |
| contents | We show that every bipartite planar graph with minimum degree at least 3 has proper orientation number at most 3. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1904_00563 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Proper 3-orientations of bipartite planar graphs with minimum degree at least 3 Noguchi, Kenta Combinatorics 05C20, 05C15 We show that every bipartite planar graph with minimum degree at least 3 has proper orientation number at most 3. |
| title | Proper 3-orientations of bipartite planar graphs with minimum degree at least 3 |
| topic | Combinatorics 05C20, 05C15 |
| url | https://arxiv.org/abs/1904.00563 |