Proper orientation, proper biorientation and semi-proper orientation numbers of graphs
From MaRDI portal
Publication:2680602
Recommendations
Cites work
- Digraphs
- Is there any polynomial upper bound for the universal labeling of graphs?
- Note on (semi-)proper orientation of some triangulated planar graphs
- On the proper orientation number of bipartite graphs
- On the semi-proper orientations of graphs
- Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
- Proper orientation number of triangle-free bridgeless outerplanar graphs
- Proper orientation of cacti
- Proper orientations and proper chromatic number
- Proper orientations of planar bipartite graphs
- The complexity of the proper orientation number
- Weighted proper orientations of trees and graphs of bounded treewidth
Cited in
(2)
This page was built for publication: Proper orientation, proper biorientation and semi-proper orientation numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680602)