𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Circuits through prescribed vertices in k-connected k-regular graphs

✍ Scribed by Roland Häggkvist; Wolfgang Mader

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
178 KB
Volume
39
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We show that every set of $k+\lfloor{1\over 3}\sqrt{k}\rfloor$ vertices in a k‐connected k‐regular graph belongs to some circuit. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 145–163, 2002

📜 SIMILAR VOLUMES

Cycles passing through k + 1 vertices in
Cycles passing through k + 1 vertices in k-connected graphs
✍ Jun Fujisawa; Tomoki Yamashita 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract In this article, we prove the following theorem. Let __k__ ≥ 3 be an integer, __G__ be a __k__‐connected graph with minimum degree __d__ and __X__ be a set of __k__ + 1 vertices on a cycle. Then __G__ has a cycle of length at least min {2d,|V(G)|} passing through __X__. This result give

Hamiltonian circuits in N2-locally conne
Hamiltonian circuits in N2-locally connected K1,3-free graphs
✍ ZdeněK Ryjáček 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB 👁 1 views

## Abstract There are many results concerned with the hamiltonicity of __K__~1,3~‐free graphs. In the paper we show that one of the sufficient conditions for the __K__~1,3~‐free graph to be Hamiltonian can be improved using the concept of second‐type vertex neighborhood. The paper is concluded with