Abstract
Abstract A strong oriented k-coloring of an oriented graph G is a homomorphism ϕ from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any pairs of arcs u v → and z t → of G, we have ϕ ( v ) − ϕ ( u ) ≠ − ( ϕ ( t ) − ϕ ( z ) ) . The strong oriented chromatic number χ s ( G ) is the smallest k such that G admits a strong oriented k-coloring. In this paper, we consider the following problem: Let i ⩾ 4 be an integer. Let G be an oriented planar graph without cycles of lengths 4 to i. What is the strong oriented chromatic number of G?
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
