On the semi-proper orientations of graphs

DOI10.1016/j.dam.2020.07.003zbMath1461.05109arXiv1905.02867OpenAlexW3042077941MaRDI QIDQ2663989

Ali Dehghan, Frédéric Havet

Publication date: 20 April 2021

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

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

zbMATH Keywords

planar graphsproper orientation numbersemi-proper orientationweighted orientation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Proper orientation, proper biorientation and semi-proper orientation numbers of graphs ⋮ On the in-out-proper orientations of graphs ⋮ On the proper arc labeling of directed graphs

Cites Work

• Unnamed Item
• Proper orientation of cacti
• Computation of lucky number of planar graphs is NP-hard
• The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
• On the proper orientation number of bipartite graphs
• 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
• Edge weights and vertex colours
• The complexity of the proper orientation number
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• Weighted proper orientations of trees and graphs of bounded treewidth
• Sequence variations of the 1-2-3 Conjecture and irregularity strength
• Hard tiling problems with simple tiles

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