๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Linear coloring of graphs embeddable in a surface of nonnegative characteristic

โœ Scribed by WeiFan Wang; Chao Li

Publisher
SP Science China Press
Year
2009
Tongue
English
Weight
358 KB
Volume
52
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Edge colorings of graphs embeddable in a
Edge colorings of graphs embeddable in a surface of low genus
โœ Hugh Hind; Yue Zhao ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 357 KB

In this paper, by using the Discharging Method, we show that any graph with maximum degree A 1>8 that is embeddable in a surface 2~ of characteristic X(Z)>~0 is class one and any graph with maximum degree A>~9 that is embeddable in a surface Z of characteristic X(Z)=-1 is class one. For surfaces of

A generalization of edge-coloring in gra
A generalization of edge-coloring in graphs
โœ S. Louis Hakimi; Oded Kariv ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 754 KB

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex u at most m(u) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(u) = 1 for all

A note on defective colorings of graphs
A note on defective colorings of graphs in surfaces
โœ Dan Archdeacon ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 139 KB ๐Ÿ‘ 2 views

A graph is (rn, k)-colorable if its vertices can be colored with rn colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. In a recent paper Cowen. Cowen, and Woodall proved that, for each compact surface S, there exists an integer k = k(S) such that eve