Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. It is known that the list edge chromatic number Χ′l(G) of any outer-1-planar graph G with maximum degree Δ(G) ≥ 5 is exactly its maximum degree. In this paper, we prove Χ′l(G) = Δ(G) for outer-1-planar graphs G with Δ(G) = 4 and with the crossing distance being at least 3.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 2, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.