✦ LIBER ✦

On colour-blind distinguishing colour pallets in regular graphs

✍ Scribed by Jakub Przybyło

Book ID: 120694215
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 178 KB
Volume: 28
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9556-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-distinguishing proper edge colour

Vertex-distinguishing proper edge colourings of some regular graphs

✍ Janka Rudašová; Roman Soták 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Regular and (+)-Regular Coloured Graphs

Regular and (+)-Regular Coloured Graphs on Euclidean 3-Manifolds

✍ Alba Valverde 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 168 KB

On the number of edge-colourings of regu

On the number of edge-colourings of regular bipartite graphs

✍ A. Schrijver 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Acyclic 4-edge colouring of non-regular

Acyclic 4-edge colouring of non-regular subcubic graphs in linear time

✍ Lukot’ka, Robert 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 362 KB

A Note on Alternating Cycles in Edge-Col

A Note on Alternating Cycles in Edge-Coloured Graphs

✍ Anders Yeo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is

A Note on Large Rainbow Matchings in Edg

A Note on Large Rainbow Matchings in Edge-coloured Graphs

✍ Allan Lo, Ta Sheng Tan 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 138 KB