𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Even polyhedral decompositions of cubic graphs

✍ Scribed by M. Preissmann

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
136 KB
Volume
32
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

An even polyhedral decomposition of a finite cubic grap;'i G is defined a-, a sel of elem,:nlar~ cycles of even length ir~ G with the property that each edge of G lies in exactly two of them. l~" G has chromatic index three, then G has an e~en !polyhedral decomposition. We ~d~ow ~hat. contrary to a theorem of Szekeres . this property (m have an even p¢~lyhcdra! decompo~iliom doesn't characterize the cubic graphs of cttromatic inde~ three. In particuizm there exit,Is mq infinite family of sharks all having an even polyhedJal decomposiiion.

📜 SIMILAR VOLUMES

Minimum path decompositions of oriented
Minimum path decompositions of oriented cubic graphs
✍ K. B. Reid; Keith Wayland 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 1 views

Pullman [3] conjectured that if k is an odd positive integer, then every orientation of a regular graph of degree k has a minimum decomposition which contains no vertex which is both the initial vertex of some path in the decomposition and the terminal vertex of some other path in the decomposition

Even cycle decompositions of complete gr
Even cycle decompositions of complete graphs minus a 1-factor
✍ Brian Alspach; Susan Marshall 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 873 KB

Some sufficient conditions are proven for the complete graph of even order with a 1-factor removed to be decomposable into even length cycles. 0 1994 John Wiley & Sons, Inc. ## 1. Introduction It is natural to ask when a complete graph admits a decomposition into cycles of some fixed length. Since

Even cycles with prescribed chords in pl
Even cycles with prescribed chords in planar cubic graphs
✍ Herbert Fleischner 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 254 KB

The following result is being proved. Theorem: Let e be an arbitrary line of the 2-connected, 3-regular, planar graph G such that e cioes not belong to any cut set of size 2. Then G contains an even cycle for which e is a chord.

Even-hole-free graphs part I: Decomposit
Even-hole-free graphs part I: Decomposition theorem
✍ Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB

## Abstract We prove a decomposition theorem for even‐hole‐free graphs. The decompositions used are 2‐joins and star, double‐star and triple‐star cutsets. This theorem is used in the second part of this paper to obtain a polytime recognition algorithm for even‐hole‐free graphs. © 2002 John Wiley &

Atoll decompositions of graphs
Atoll decompositions of graphs
✍ Fred Buckley 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

## Abstract An island decomposition of a graph __G__ consists of a set of vertex‐disjoint paths which cover the vertex set of __G.__ If the endpoints of the paths are mutually nonadjacent, then we have an atoll decomposition. We characterize graphs requiring two paths in an island decomposition yet