After a brief historical account, a few simple structural theorems about plane graphs
useful for coloring are stated, and two simple applications of discharging are given.
Afterwards, the following types of proper colorings of plane graphs are discussed, both in
their classical and choosability (list coloring) versions: simultaneous colorings of vertices,
edges, and faces (in all possible combinations, including total coloring), edge-coloring,
cyclic coloring (all vertices in any small face have different colors), 3-coloring, acyclic
coloring (no 2-colored cycles), oriented coloring (homomorphism of directed graphs to
small tournaments), a special case of circular coloring (the colors are points of a small
cycle, and the colors of any two adjacent vertices must be nearly opposite on this cycle),
2-distance coloring (no 2-colored paths on three vertices), and star coloring (no 2-colored
paths on four vertices). The only improper coloring discussed is injective coloring (any two
vertices having a common neighbor should have distinct colors).
After a brief historical account, a few simple structural theorems about plane graphsuseful for coloring are stated, and two simple applications of discharging are given.Afterwards, the following types of proper colorings of plane graphs are discussed, both intheir classical and choosability (list coloring) versions: simultaneous colorings of vertices,edges, and faces (in all possible combinations, including total coloring), edge-coloring,cyclic coloring (all vertices in any small face have different colors), 3-coloring, acycliccoloring (no 2-colored cycles), oriented coloring (homomorphism of directed graphs tosmall tournaments), a special case of circular coloring (the colors are points of a smallcycle, and the colors of any two adjacent vertices must be nearly opposite on this cycle),2-distance coloring (no 2-colored paths on three vertices), and star coloring (no 2-coloredpaths on four vertices). The only improper coloring discussed is injective coloring (any twovertices having a common neighbor should have distinct colors).
การแปล กรุณารอสักครู่..