✦ LIBER ✦

A note on the strong chromatic index of bipartite graphs

✍ Scribed by K. Nakprasit

Book ID: 108113860
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 112 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic uniquenes of bipartite

On the chromatic uniquenes of bipartite graphs

✍ Pablo M Salzberg; Miguel A López; Reinaldo E Giudici 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 500 KB

We prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km,,,+k, l~rt3K,,,,,,,+k, with m~>2 and 0~ 3, where K~,,, denote the graph obtained from K,,,n by deleting one edge. As a particular case we prove a conjecture made by C.Y. Chao in

A generalized construction of chromatic

A generalized construction of chromatic index critical graphs from bipartite graphs

✍ Michael Plantholt 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

W e prove that any graph with maximum degree n which can be obtained by removing exactly 2n -1 edges from the join K? -K, ,, is n-critical This generalizes special constructions of critical graphs by S Fiorini and H P Yap, and suggests a possible extension of another general construction due to Yap

A Note on the Game Chromatic Index of Gr

A Note on the Game Chromatic Index of Graphs

✍ Tomasz Bartnicki; Jarosław Grytczuk 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 53 KB

The strong chromatic index of Halin grap

The strong chromatic index of Halin graphs

✍ Hsin-Hao Lai; Ko-Wei Lih; Ping-Ying Tsai 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 262 KB

The Strong Chromatic Index of Random Gra

The Strong Chromatic Index of Random Graphs

✍ Frieze, Alan; Krivelevich, Michael; Sudakov, Benny 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 160 KB

A Bound on the Strong Chromatic Index of

A Bound on the Strong Chromatic Index of a Graph

✍ Michael Molloy; Bruce Reed 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 695 KB

We show that the strong chromatic index of a graph with maximum degree 2 is at most (2&=) 2 2 , for some =>0. This answers a question of Erdo s and Nes etr il. 1997 Academic Press ## 1. Introduction A strong edge-colouring of a (simple) graph, G, is a proper edge-colouring of G with the added res