Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
Good and semi-strong colorings of oriented planar graphs
Information Processing Letters
On the $\lambda$-Number of $Q_n$ and Related Graphs
SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
The chromatic number of oriented graphs
Journal of Graph Theory
There exist oriented planar graphs with oriented chromatic number at least sixteen
Information Processing Letters
A Theorem about the Channel Assignment Problem
SIAM Journal on Discrete Mathematics
Labeling Planar Graphs with Conditions on Girth and Distance Two
SIAM Journal on Discrete Mathematics
Oriented colorings of triangle-free planar graphs
Information Processing Letters
A bound on the chromatic number of the square of a planar graph
Journal of Combinatorial Theory Series B
Minimum cycle bases of Halin graphs
Journal of Graph Theory
On backbone coloring of graphs
Journal of Combinatorial Optimization
L(2,1) -labeling of oriented planar graphs
Discrete Applied Mathematics
| Hi-index | 0.89 |
A 2-dipath k-coloring f of an oriented graph G→ is a mapping from V(G→) to the color set {1, 2 ....k} such that f(x) ≠ f(y) whenever two vertices x and y are linked by a directed path of length 1 or 2. The 2-dipath chromatic number χ→2(G→) of G→ is the smallest k such that G→ has a 2-dipath k-coloring. In this paper we prove that if G→ is an oriented Halin graph, then χ→2(G→) ≤ 7. There exist infinitely many oriented Halin graphs G→ such that χ→2(G→) = 7.