✦ LIBER ✦

The circumference of a graph with no -minor, II

✍ Scribed by Guantao Chen; Xingxing Yu; Wenan Zang

Book ID: 119292671
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 497 KB
Volume: 102
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2012.07.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Characterization of Graphs with No Cub

A Characterization of Graphs with No Cube Minor

✍ John Maharry 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 418 KB

In this paper it is shown that any 4-connected graph that does not contain a minor isomorphic to the cube is a minor of the line graph of V n for some n 6 or a minor of one of five graphs. Moreover, there exists a unique 5-connected graph on at least 8 vertices with no cube minor and a unique 4-conn

A Characterization of Graphs with No Oct

A Characterization of Graphs with No Octahedron Minor

✍ Guoli Ding 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 637 KB

A Splitter for Graphs with No Petersen F

A Splitter for Graphs with No Petersen Family Minor

✍ John Maharry 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The Petersen family consists of the seven graphs that can be obtained from the Petersen Graph by Y2-and 2Y-exchanges. A splitter for a family of graphs is a maximal 3-connected graph in the family. In this paper, a previously studied graph, Q 13, 3 , is shown to be a splitter for the set of all grap

The circumference of the square of a con

The circumference of the square of a connected graph

✍ Brandt, Stephan; Müttel, Janina; Rautenbach, Dieter 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

A lower bound for the circumference of a

A lower bound for the circumference of a graph

✍ Nathan Linial 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o

A degree condition for the circumference

A degree condition for the circumference of a graph

✍ Nathaniel Dean; Pierre Fraisse 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 1 views

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let rn be any positive integer. Suppose G is a 2-connected graph with vertices x,, . . . , x, and edge set E that satisfies the proper