𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Circuit Decompositions of Eulerian Graphs

✍ Scribed by Genghua Fan; Cun-Quan Zhang

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
312 KB
Volume
78
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Circuit decompositions of join-covered g
Circuit decompositions of join-covered graphs
✍ Marcelo H. de Carvalho; C. H. C. Little 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract In this paper, we focus our attention on join‐covered graphs, that is, ±1‐weighted graphs, without negative circuits, in which every edge lies in a zero‐weight circuit. Join covered graphs are a natural generalization of matching‐covered graphs. Many important properties of matching cov

Packing Odd Circuits in Eulerian Graphs
Packing Odd Circuits in Eulerian Graphs
✍ James F. Geelen; Bertrand Guenin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Let C be the clutter of odd circuits of a signed graph ðG; SÞ: For nonnegative integral edge-weights w; we are interested in the linear program minðw t x: xðCÞ51; for C 2 C; and x50Þ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem,

Compatible circuit decompositions of 4-r
Compatible circuit decompositions of 4-regular graphs
✍ Herbert Fleischner; François Genest; Bill Jackson 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

## Abstract A transition system __T__ of an Eulerian graph __G__ is a family of partitions of the edges incident to each vertex of __G__ into transitions, that is, subsets of size two. A circuit decomposition $\cal C$ of __G__ is compatible with __T__ if no pair of adjacent edges of __G__ is both a

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

Commuting decompositions of complete gra
Commuting decompositions of complete graphs
✍ Saieed Akbari; Allen Herman 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract We say that two graphs __G__ and __H__ with the same vertex set commute if their adjacency matrices commute. In this article, we show that for any natural number __r__, the complete multigraph __K__ is decomposable into commuting perfect matchings if and only if __n__ is a 2‐power. Also