On the proper orientation number of bipartite graphs

DOI10.1016/j.tcs.2014.11.037zbMath1320.05035OpenAlexW1991847585MaRDI QIDQ484321

Phablo F. S. Moura, Susanna F. de Rezende, Nathann Cohen, Frédéric Havet, Julio Araujo

Publication date: 6 January 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.037

zbMATH Keywords

bipartite graphgraph coloringproper orientation

Mathematics Subject Classification ID

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 (12)

On the proper orientation number of chordal graphs ⋮ Proper orientation of cacti ⋮ 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 3-orientations of bipartite planar graphs with minimum degree at least 3 ⋮ Is there any polynomial upper bound for the universal labeling of graphs? ⋮ Proper orientations of planar bipartite graphs ⋮ Proper orientations and proper chromatic number ⋮ 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
• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The complexity of the proper orientation number
• Planar Formulae and Their Uses
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE

This page was built for publication: On the proper orientation number of bipartite graphs