✦ LIBER ✦

Edge proximity conditions for extendability in cubic bipartite graphs

✍ Scribed by R. E. L. Aldred; Bill Jackson

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 123 KB
Volume: 55
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20226

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We show that a set M of m edges in a cyclically (3__m__ − 2)‐edge‐connected cubic bipartite graph is contained in a 1‐factor whenever the edges in M are pairwise distance at least f(m) apart, where

📜 SIMILAR VOLUMES

Two sufficient conditions for a 2-factor

Two sufficient conditions for a 2-factor in a bipartite graph

✍ P. Katerinis 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

A Degree Sum Condition for the Existence

A Degree Sum Condition for the Existence of a Contractible Edge in a κ-Connected Graph

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is known that a noncomplete }-connected graph of minimum degree of at least w 5} 4 x contains a }-contractible edge, i.e., an edge whose contraction yields again a }-connected graph. Here we prove the stronger statement that a noncomplete }-connected graph for which the sum of the degrees of any