✦ LIBER ✦

Strong products ofϰ-critical graphs

✍ Scribed by Sandi Klavžar

Publisher: Springer
Year: 1993
Tongue: English
Weight: 480 KB
Volume: 45
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf01855874

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Sandi Klavžar 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 59 KB

Strong products of Kneser graphs

✍ Sandi Klavžar; Uroš Milutinović 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Let G [XI H be the strong product of graphs G and H. We give a short proof that Kneser graphs are then used to demonstrate that this lower bound is sharp. We also prove that for every n > 2 there is an infinite sequence of pairs of graphs G and G' such that G' is not a retract of G while G' IXI K,

Retracts of strong products of graphs

✍ W. Imrich; S. Klavžar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 750 KB

Connectivity of Strong Products of Graph

Connectivity of Strong Products of Graphs

✍ Simon Špacapan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 329 KB

Non-κ-critical vertices in graphs

✍ H.J. Veldman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 494 KB

Hamiltonian threshold for strong product

Hamiltonian threshold for strong products of graphs

✍ Daniel Král'; Ladislav Stacho 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We prove that the strong product of any at least ${({\rm ln}}\, {2})\Delta+{O}(\sqrt{\Delta})$ non‐trivial connected graphs of maximum degree at most Δ is pancyclic. The obtained result is asymptotically best possible since the strong product of ⌊(ln 2)__D__⌋ stars __K__~1,__D__~ is not