✦ LIBER ✦

Covering Graphs by Simple Circuits

✍ Scribed by Itai, Alon; Lipton, Richard J.; Papadimitriou, Christos H.; Rodeh, M.

Book ID: 118174081
Publisher: Society for Industrial and Applied Mathematics
Year: 1981
Tongue: English
Weight: 448 KB
Volume: 10
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0210058

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering Multigraphs by Simple Circuits

✍ Alon, N.; Tarsi, M. 📂 Article 📅 1985 🏛 Society for Industrial and Applied Mathematics ⚖ 598 KB

Covering Graphs by Cycles

✍ Fan, Genghua 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 687 KB

Covering the edges of a graph by circuit

Covering the edges of a graph by circuits

✍ D. Ya. Kesel'man 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 847 KB

Circuit extension and circuit double cov

Circuit extension and circuit double cover of graphs

✍ Miao, Zhengke; Ye, Dong; Zhang, Cun-Quan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 393 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.