Search

Your search keyword '"WEIFAN WANG"' showing total 1 results
Start Over Author "WEIFAN WANG" Topic entire coloring Topic graph coloring

Refine your results

1 results on '"WEIFAN WANG"'

1. PLANAR GRAPHS WITH Δ ≥ 9 ARE ENTIRELY (Δ + 2)-COLORABLE.

Author

YIQIAO WANG, XIAOXUE HU, and WEIFAN WANG

Subjects
*GRAPH theory, *PLANAR graphs, *GRAPH coloring, *GEOMETRY, *MATHEMATICS
Abstract

A plane graph G is entirely κ-colorable if V (G) ∪ E(G) ∪ F(G) can be colored with κ colors such that any two adjacent or incident elements receive different colors. In 1993, Borodin proved that every plane graph G with maximum degree Δ ≥ 12 is entirely (Δ + 2)-colorable. In this paper, we improve this result by showing that every plane graph G with Δ ≥ 9 is entirely (Δ + 2)-colorable. [ABSTRACT FROM AUTHOR]

Published
2014
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results