✦ LIBER ✦

The Entire Coloring of Series-Parallel Graphs

✍ Scribed by Jian-liang Wu; Yu-liang Wu

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2005
Tongue: English
Weight: 246 KB
Volume: 21
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s10255-005-0215-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromaticity of series-parallel graphs

✍ K.M. Koh; C.P. Teo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 454 KB

By applying a sequence of edge-gluings on a set of cycles each of length k, we obtain a special series-parallel graph. The well-known k-gon tree theorem (see [l, lo]) states that these graphs form a X-equivalence class. Many of the other known classes of X-unique graphs and X-equivalence classes are

Structural theorem on plane graphs with

Structural theorem on plane graphs with application to the entire coloring number

✍ Borodin, Oleg V. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB 👁 1 views

In 1973, Kronk and Mitchem (Discrete Math. (5) 255-260) conjectured that the vertices, edges and faces of each plane graph G may be colored with D(G) + 4 colors, where D(G) is the maximum degree of G, so that any two adjacent or incident elements receive distinct colors. They succeeded in verifying

Series-parallel subgraphs of planar grap

Series-parallel subgraphs of planar graphs

✍ Ehab S. Elmallah; Charles J. Colbourn 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 435 KB

A parallel algorithm for solving the col

A parallel algorithm for solving the coloring problem on trapezoid graphs

✍ Shin-ichi Nakayama; Shigeru Masuyama 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 501 KB

The circular chromatic number of series-

The circular chromatic number of series-parallel graphs

✍ Hell, Pavol; Zhu, Xuding 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB 👁 2 views

In this article, we consider the circular chromatic number χ c (G) of series-parallel graphs G. It is well known that series-parallel graphs have chromatic number at most 3. Hence, their circular chromatic numbers are at most 3. If a seriesparallel graph G contains a triangle, then both the chromati

Multi-coloring the Mycielskian of graphs

✍ Wensong Lin; Daphne Der-Fen Liu; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract A __k__‐fold coloring of a graph is a function that assigns to each vertex a set of __k__ colors, so that the color sets assigned to adjacent vertices are disjoint. The __k__th chromatic number of a graph __G__, denoted by χ~__k__~(__G__), is the minimum total number of colors used in a