𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite cubic graphs and a shortness exponent

✍ Scribed by P.J. Owens

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
148 KB
Volume
44
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The class of 3-connected bipartite cubic graphs is shown to contain a oon-Hamiltonian graph with only 78 vertices and to have a shortness exponent less than one.

In this paper, a graph is a simple undirected gaph and a subgraph is an induced subgraph. For a~ay graph G, v(G) denotes the number of vertices and h(G) the

📜 SIMILAR VOLUMES

A shortness exponent for r-regular r-con
A shortness exponent for r-regular r-connected graphs
✍ Brad Jackson; T. D. Parsons 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB 👁 1 views

## Abstract Let __r__≧ 3 be an integer. It is shown that there exists ε= ε(__r__), 0 < ε < 1, and an integer __N__ = __N(r__) > 0 such that for all __n__ ≧ __N__ (if __r__ is even) or for all even __n__ ≧ __N__(if __r__ is odd), there is an __r__‐connected regular graph of valency __r__ on exactly

Det-extremal cubic bipartite graphs
Det-extremal cubic bipartite graphs
✍ M. Funk; Bill Jackson; D. Labbate; J. Sheehan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract Let __G__ be a connected __k__–regular bipartite graph with bipartition __V__(__G__) = __X__ ∪ __Y__ and adjacency matrix __A__. We say __G__ is det‐extremal if __per__ (__A__) = |__det__(A)|. Det–extremal __k__–regular bipartite graphs exist only for __k__ =  2 or 3. McCuaig has charac

Cyclically 5-edge-connected cubic planar
Cyclically 5-edge-connected cubic planar graphs and shortness coefficients
✍ P. J. Owens 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

## Abstract It is shown that some classes of cyclically 5‐edge‐connected cubic planar graphs with only one type of face besides pentagons contain non‐Hamiltonian members and have shortness coefficients less than unity.

Extremal bipartite subgraphs of cubic tr
Extremal bipartite subgraphs of cubic triangle-free graphs
✍ Glenn Hopkins; William Staton 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

Edge proximity conditions for extendabil
Edge proximity conditions for extendability in cubic bipartite graphs
✍ R. E. L. Aldred; Bill Jackson 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

## 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 © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 112–120, 2007