Proper orientations of planar bipartite graphs

DOI10.1007/S00373-017-1836-XzbMath1380.05038arXiv1609.06778OpenAlexW2963514883MaRDI QIDQ1684937

Sebastián González Hermosillo de la Maza, Bojan Mohar, Naoki Matsumoto, Fiachra Knox, Cláudia Linhares Sales

Publication date: 12 December 2017

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

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

zbMATH Keywords

planar graphsbipartite graphscoloringproper orientation number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

On the proper orientation number of chordal graphs ⋮ Weighted proper orientations of trees and graphs of bounded treewidth ⋮ On the semi-proper orientations of graphs ⋮ Proper 3-orientations of bipartite planar graphs with minimum degree at least 3 ⋮ 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

• Proper orientation of cacti
• On the proper orientation number of bipartite graphs
• 3-trees with few vertices of degree 3 in circuit graphs
• The complexity of the proper orientation number
• On the degrees of the vertices of a directed graph
• Trees in Polyhedral Graphs

This page was built for publication: Proper orientations of planar bipartite graphs