✦ LIBER ✦

The Strong Chromatic Index of Random Graphs

✍ Scribed by Frieze, Alan; Krivelevich, Michael; Sudakov, Benny

Book ID: 118198914
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 160 KB
Volume: 19
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480104445757

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong chromatic index of subset graphs

✍ Quinn, Jennifer J.; Benjamin, Arthur T. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

The strong chromatic index of a graph G, denoted sq(G), is the minimum number of parts needed to partition the edges of G into induced matchings. For 0 ≤ k ≤ l ≤ m, the subset graph S m (k, l) is a bipartite graph whose vertices are the kand l-subsets of an m element ground set where two vertices ar

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

Strong Chromatic Index of 2-Degenerate G

Strong Chromatic Index of 2-Degenerate Graphs

✍ Gerard Jennhwa Chang; N. Narayanan 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 508 KB

The strong chromatic index of C4-free gr

The strong chromatic index of C4-free graphs

✍ Mohammad Mahdian 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

On the strong chromatic index of cubic H

On the strong chromatic index of cubic Halin graphs

✍ Ko-Wei Lih; Daphne Der-Fen Liu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 362 KB

The strong chromatic index of complete c

The strong chromatic index of complete cubic Halin graphs

✍ W.C. Shiu; W.K. Tam 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 809 KB

A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.