𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An excluded minor theorem for the octahedron

✍ Scribed by Maharry, John

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
221 KB
Volume
31
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

In this article it is shown that every 4-connected graph that does not contain a minor isomorphic to the octahedron is isomorphic to the square of an odd cycle.

πŸ“œ SIMILAR VOLUMES

An excluded minor theorem for the Octahe
An excluded minor theorem for the Octahedron plus an edge
✍ John Maharry πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract Let __G__ be the unique 4‐connected simple graph obtained by adding an edge to the Octahedron. Every 4‐connected graph that does not contain a minor isomorphic to __G__ is either planar or the square of an odd cycle. Β© 2007 Wiley Periodicals, Inc. J Graph Theory 57: 124–130, 2008

A Simpler Proof of the Excluded Minor Th
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 223 KB

We give a simple proof of the fact (which follows from the Robertson Seymour theory) that a graph which is minimal of genus g cannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson Seymour t

On the Excluded Minors for Quaternary Ma
On the Excluded Minors for Quaternary Matroids
✍ J.F. Geelen; J.G. Oxley; D.L. Vertigan; G.P. Whittle πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 221 KB

This paper strengthens the excluded-minor characterization of GF(4)-representable matroids. In particular, it is shown that there are only finitely many 3-connected matroids that are not GF(4)-representable and that have no U 2, 6 -, U 4, 6 -, P 6 -, F & 7 -, or (F & 7 )\*-minors. Explicitly, these

The last excluded case of Dirac's map-co
The last excluded case of Dirac's map-color theorem for choosability
✍ Daniel KrΓ‘l'; Riste SΜ†krekovski πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 294 KB

## Abstract In 1890, Heawood established the upper bound $H ( \varepsilon )= \left \lfloor 7+\sqrt {24\varepsilon +1}/{2}\right \rfloor$ on the chromatic number of every graph embedded on a surface of Euler genus Ξ΅ β‰₯ 1. Almost 80 years later, the bound was shown to be tight by Ringel and Youngs. Th