The 2-dipath chromatic number of Halin graphs
From MaRDI portal
Publication:845671
DOI10.1016/J.IPL.2006.02.009zbMATH Open1184.05047OpenAlexW1977038530MaRDI QIDQ845671FDOQ845671
Authors: 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
Recommendations
combinatorial problemsoriented coloring2-dipath chromatic number2-dipath coloringoriented Halin graph
Cites Work
- On the maximum average degree and the oriented chromatic number of a graph
- Labelling Graphs with a Condition at Distance 2
- Good and semi-strong colorings of oriented planar graphs
- The chromatic number of oriented graphs
- Oriented colorings of triangle-free planar graphs
- A bound on the chromatic number of the square of a planar graph
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- The $L(2,1)$-Labeling Problem on Graphs
- Minimum cycle bases of Halin graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- List coloring Halin graphs.
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Title not available (Why is that?)
- The vertex-face total chromatic number of Halin graphs
Cited In (6)
- Homomorphisms and colourings of oriented graphs: an updated survey
- On the oriented chromatic number of Halin graphs
- Extremal Halin graphs with respect to the signless Laplacian spectra
- \(L(2,1)\)-labeling of oriented planar graphs
- Some further results on the eccentric distance sum
- On backbone coloring of graphs
This page was built for publication: The 2-dipath chromatic number of Halin graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845671)
