✦ LIBER ✦

Coloring Planar Toeplitz Graphs

✍ Scribed by Reinhardt Euler

Book ID: 108498117
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 244 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80138-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring planar Toeplitz graphs and the

Coloring planar Toeplitz graphs and the stable set polytope

✍ Reinhardt Euler 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Cliques and odd cycles are well known to induce facet-deÿning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the ÿrst part of this paper we generalize both notions to (Kn \ e)-cycles

Coloring planar graphs in parallel

✍ Joan F Boyar; Howard J Karloff 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Star coloring bipartite planar graphs

✍ H. A. Kierstead; André Kündgen; Craig Timmons 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract A __star coloring__ of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eig

Coloring Powers of Planar Graphs

✍ Agnarsson, Geir; Halldórsson, Magnús M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 183 KB

k-fold coloring of planar graphs

✍ GuanFeng Ren; YueHua Bu 📂 Article 📅 2010 🏛 SP Science China Press 🌐 English ⚖ 296 KB

Coloring planar perfect graphs by decomp

Coloring planar perfect graphs by decomposition

✍ W. -L. Hsu 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 282 KB