The 2-dipath chromatic number of Halin graphs

DOI10.1016/j.ipl.2006.02.009zbMath1184.05047OpenAlexW1977038530MaRDI QIDQ845671

Chen Min, Wang Weifan

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.02.009

zbMATH Keywords

combinatorial problemsoriented coloring2-dipath chromatic number2-dipath coloringoriented Halin graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ On backbone coloring of graphs ⋮ \(L(2,1)\)-labeling of oriented planar graphs ⋮ Some further results on the eccentric distance sum

Cites Work

• Unnamed Item
• Unnamed Item
• Oriented colorings of triangle-free planar graphs
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• A bound on the chromatic number of the square of a planar graph
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• The chromatic number of oriented graphs
• The vertex-face total chromatic number of Halin graphs
• Minimum cycle bases of Halin graphs
• A Theorem about the Channel Assignment Problem
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: The 2-dipath chromatic number of Halin graphs