✦ LIBER ✦

A note on the edge-reconstruction of K1,m-free graphs

✍ Scribed by I Krasikov

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 176 KB
Volume: 49
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90033-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on the reconstruction of vertex col

Note on the reconstruction of vertex colored graphs

✍ R. Taylor 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 2 views

On the Edge Distribution in Triangle-fre

On the Edge Distribution in Triangle-free Graphs

✍ M. Krivelevich 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 517 KB

On the Edge Reconstruction of Graphs Emb

On the Edge Reconstruction of Graphs Embedded in Surfaces, III

✍ Yue Zhao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 239 KB

The existence of a 2-factor in K1, n-fre

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

A note on the matching numbers of triang

A note on the matching numbers of triangle-free graphs

✍ Roberto W. Frucht; Reinaldo E. Giudici 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

A note on the independence number of tri

A note on the independence number of triangle-free graphs

✍ James B. Shearer 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 188 KB