On the in-out-proper orientations of graphs

DOI10.1016/J.DAM.2021.06.015zbMath1469.05054arXiv2106.13357OpenAlexW3182341677MaRDI QIDQ2043367

Ali Dehghan

Publication date: 2 August 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.13357

zbMATH Keywords

subcubic graphsproper orientationin-out-degreein-out-proper orientationin-out-proper orientation number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On the proper arc labeling of directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Proper orientation of cacti
• On the proper orientation number of bipartite graphs
• On the complexity of deciding whether the regular number is at most two
• Coloring chip configurations on graphs and digraphs
• Is there any polynomial upper bound for the universal labeling of graphs?
• Proper orientations of planar bipartite graphs
• Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
• The complexity of the proper orientation number
• Weighted proper orientations of trees and graphs of bounded treewidth
• Note on (semi-)proper orientation of some triangulated planar graphs
• On the semi-proper orientations of graphs
• Proper orientation number of triangle‐free bridgeless outerplanar graphs

This page was built for publication: On the in-out-proper orientations of graphs