✦ LIBER ✦

Edge-Colorings with No Large Polychromatic Stars

✍ Scribed by Tao Jiang

Book ID: 106048112
Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 102 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex coloring without large polychroma

Vertex coloring without large polychromatic stars

✍ Csilla Bujtás; E. Sampathkumar; Zsolt Tuza; Charles Dominic; L. Pushpalatha 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 242 KB

The number of edge colorings with no mon

The number of edge colorings with no monochromatic triangle

✍ Yuster, Raphael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 639 KB

Let F(n, k) denote the maximum number of t w o edge colorings of a graph on n vertices that admit no monochromatic Kk. la complete graph on k vertices). The following results are proved: f ( n , 3) = 2Ln2/41 for all n 2 6. f ( n , k) = 2((k~2)/(2k-2)+o( 1))n'. In particular, the first result solves

Edge Coloring of Embedded Graphs with La

Edge Coloring of Embedded Graphs with Large Girth

✍ Xuechao Li; Rong Luo 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 255 KB

Acyclic edge coloring of graphs with lar

Acyclic edge coloring of graphs with large girths

✍ QiZhong Lin, JianFeng Hou, Yue Liu 📂 Article 📅 2012 🏛 SP Science China Press 🌐 English ⚖ 235 KB

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs with large girth

✍ Dongxiao Yu; Jianfeng Hou; Guizhen Liu; Bin Liu; Lan Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Color-critical graphs and hypergraphs wi

Color-critical graphs and hypergraphs with few edges and no short cycles

✍ H.L. Abbott; D.R. Hare; B. Zhou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 378 KB

We give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or shorter and with relatively few edges.