On the proper arc labeling of directed graphs

DOI10.1007/S00373-021-02435-1zbMath1480.05110OpenAlexW4200289184MaRDI QIDQ2062885

Arash Ahadi, Ali Dehghan

Publication date: 3 January 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02435-1

zbMATH Keywords

directed graphproper orientationoptimal proper arc labelingproper arc labelingproper arc labeling number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• 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
• On the proper orientation number of chordal graphs
• Is there any polynomial upper bound for the universal labeling of graphs?
• Proper orientations of planar bipartite graphs
• On the in-out-proper orientations of 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 proper arc labeling of directed graphs