On the proper orientation number of chordal graphs
From MaRDI portal
Publication:820574
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Graph theory
- Is there any polynomial upper bound for the universal labeling of graphs?
- Kernelization. Theory of parameterized preprocessing
- On the proper orientation number of bipartite graphs
- Parameterized algorithms
- Proper orientation number of triangle-free bridgeless outerplanar graphs
- Proper orientation of cacti
- Proper orientations of planar bipartite graphs
- Quasi-threshold graphs
- The complexity of the proper orientation number
- Weighted proper orientations of trees and graphs of bounded treewidth
Cited in
(8)- On the proper arc labeling of directed graphs
- On the proper orientation number of chordal graphs
- On the in-out-proper orientations of graphs
- Proper orientations and proper chromatic number
- Complexity of approximating the oriented diameter of chordal graphs
- The complexity of the proper orientation number
- Weighted proper orientations of trees and graphs of bounded treewidth
- On the proper orientation number of bipartite graphs
This page was built for publication: On the proper orientation number of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820574)