✦ LIBER ✦

Circuit extension and circuit double cover of graphs

✍ Scribed by Miao, Zhengke; Ye, Dong; Zhang, Cun-Quan

Book ID: 120544186
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 393 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.06.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering Graphs by Simple Circuits

✍ Itai, Alon; Lipton, Richard J.; Papadimitriou, Christos H.; Rodeh, M. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 448 KB

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

Shortest Circuit Covers of Cubic Graphs

✍ B. Jackson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 298 KB

We show that the edge set of a bridgeless cubic graph \(G\) can be covered with circuits such that the sum of the lengths of the circuits is at most \(\frac{64}{39}|E(G)|\). Stronger results are obtained for cubic graphs of large girth. 1994 Academic Press, Inc.

Kotzig frames and circuit double covers

✍ Xiaodong Zhang; Cun-Quan Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 362 KB

On semiextensions and circuit double cov

On semiextensions and circuit double covers

✍ Enrique García Moreno Esteva; Tommy R. Jensen 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 147 KB

Circuit Coverings of Graphs and a Conjec

Circuit Coverings of Graphs and a Conjecture of Pyber

✍ G.H. Fan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 260 KB

An equivalent statement of the circuit double cover conjecture is that every bridgeless graph \(G\) has a circuit cover such that each vertex \(v\) of \(G\) is contained in at most \(d(v)\) circuits of the cover, where \(d(v)\) is the degree of \(v\). Pyber conjectured that every bridgeless graph \(