✦ LIBER ✦

Edge colorings of graphs embeddable in a surface of low genus

✍ Scribed by Hugh Hind; Yue Zhao

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 357 KB
Volume: 190
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00050-8

No coin nor oath required. For personal study only.

✦ Synopsis

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 characteristic 0 or -1, these results improve earlier results of Mel'nikov.

📜 SIMILAR VOLUMES

Linear coloring of graphs embeddable in

Linear coloring of graphs embeddable in a surface of nonnegative characteristic

✍ WeiFan Wang; Chao Li 📂 Article 📅 2009 🏛 SP Science China Press 🌐 English ⚖ 358 KB

Incidence and strong edge colorings of g

Incidence and strong edge colorings of graphs

✍ Richard A. Brualdi; Jennifer J. Quinn Massey 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 485 KB

We define the incidence coloring number of a graph and bound it in terms of the maximum degree. The incidence coloring number turns out to be the strong chromatic index of an associated bipartite graph. We improve a bound for the strong chromatic index of bipartite graphs all of whose cycle lengths

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 characterization of embeddability of g

A characterization of embeddability of graphs on surfaces

✍ Liu Ying; Liu Yanpei 📂 Article 📅 1998 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 314 KB

Even edge colorings of a graph

✍ B. Devadas Acharya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Even edge colorings of a graph

✍ Noga Alon; Yoshimi Egawa 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 59 KB