Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs

07/15/2019
by   J. Ai, et al.
0

An orientation of G is a digraph obtained from G by replacing each edge by exactly one of two possible arcs with the same endpoints. We call an orientation proper if neighbouring vertices have different in-degrees. The proper orientation number of a graph G, denoted by χ⃗(G), is the minimum maximum in-degree of a proper orientation of G. Araujo et al. (Theor. Comput. Sci. 639 (2016) 14–25) asked whether there is a constant c such that χ⃗(G)≤ c for every outerplanar graph G and showed that χ⃗(G)≤ 7 for every cactus G. We prove that χ⃗(G)≤ 3 if G is a triangle-free 2-connected outerplanar graph and χ⃗(G)≤ 4 if G is a triangle-free bridgeless outerplanar graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2020

On the proper orientation number of chordal graphs

An orientation D of a graph G=(V,E) is a digraph obtained from G by repl...
research
03/12/2020

Orientations without forbidden patterns on three vertices

Given a set of oriented graphs F, a graph G is an F-graph if it admits a...
research
07/16/2021

On Vizing's edge colouring question

Soon after his 1964 seminal paper on edge colouring, Vizing asked the fo...
research
06/20/2020

AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing

Triangle listing is an important topic significant in many practical app...
research
03/05/2020

An algorithm for reconstruction of triangle-free linear dynamic networks with verification of correctness

Reconstructing a network of dynamic systems from observational data is a...
research
04/23/2015

Graphical Fermat's Principle and Triangle-Free Graph Estimation

We consider the problem of estimating undirected triangle-free graphs of...
research
09/28/2020

Extension of Gyarfas-Sumner conjecture to digraphs

The dichromatic number of a digraph D is the minimum number of colors ne...

Please sign up or login with your details

Forgot password? Click here to reset