✦ LIBER ✦

Concept of a vertex in a matroid and 3-connected graphs

✍ Scribed by A. K. Kelmans

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 316 KB
Volume: 4
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190040103

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The concept of a matroid vertex is introduced. The vertices of a matroid of a 3‐connected graph are in one‐to‐one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3‐connected graphs implies isomorphism. The concept of a vertex of a matroid leads to an equally simple proof of Whitney's theorem on the unique embedding of a 3‐connected planar graph in the sphere. It also leads to a number of new facts about 3‐connected graphs. Thus, consideration of a vertex in a matroid that is the dual of the matroid of a graph leads to a natural concept of a nonseparating cycle of a graph. Whitney's theorem on cyclic isomorphism can be strengthened (even if the nonseparating cycles of a graph are considered, the theorem is found to work) and a new criterion for planarity of 3‐connected graphs is obtained (in terms of nonseparating cycles).

📜 SIMILAR VOLUMES

Vertex suppression in 3-connected graphs

✍ Matthias Kriesell 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

## Abstract To __suppress__ a vertex $v$ in a finite graph __G__ means to delete it and add an edge from __a__ to __b__ if __a__, __b__ are distinct nonadjacent vertices which formed the neighborhood of $v$. Let $G--x$ be the graph obtained from $G-x$ by suppressing vertices of degree at most 2 as

On the Structure of 3-connected Matroids

On the Structure of 3-connected Matroids and Graphs

✍ James Oxley; Haidong Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 249 KB

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne

An 11-vertex theorem for 3-connected cub

An 11-vertex theorem for 3-connected cubic graphs

✍ R. E. L. Aldred; BauSheng; D. A. Holton; Gordon F. Royle 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 451 KB 👁 1 views

In this paper w e determine the circumstances under which a set of 11 vertices in a 3-connected cubic graph lies on a cycle. In addition, w e consider the number of such cycles that exist and characterize those graphs in which a set of 9 vertices lies in exactly two cycles.

Vertex-transitive graphs that remain con

Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors

✍ Y. O. Hamidoune; A. Lladó; S. C. López 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

A d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex and its neighbors will be called vosperian. Let be a vertex-transitive graph of

On packing 3-vertex paths in a graph

✍ Atsushi Kaneko; Alexander Kelmans; Tsuyoshi Nishimura 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB 👁 2 views

The square of a connected S(K1,3)-free g

The square of a connected S(K1,3)-free graph is vertex pancyclic

✍ George Hendry; Walter Vogler 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

We prove the conjecture of Gould and Jacobson that a connected S(K1,J free graph has a vertex pancyclic square. Since .S(K1,J is not vertex pancyclic, this result is best possible. ## Our notation generally follows that used in [l] . A graph G is Hamilroniun if it contains a cycle through all its