𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On circuit decomposition of planar Eulerian graphs

✍ Scribed by Herbert Fleischner; András Frank

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
515 KB
Volume
50
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

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