✦ LIBER ✦

Triangle-Free Circuit Decompositions and Petersen Minor

✍ Scribed by Katherine Heinrich; Jiping Liu; Cun-Quan Zhang

Book ID: 102588779
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 208 KB
Volume: 72
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1997.1808

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we characterize those simple graphs with no Petersen minor which admit triangle-free circuit decompositions.

📜 SIMILAR VOLUMES

Every longest circuit of a 3-connected,

Every longest circuit of a 3-connected, K3,3-minor free graph has a chord

✍ Etienne Birmelé 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## Abstract Carsten Thomassen conjectured that every longest circuit in a 3‐connected graph has a chord. We prove the conjecture for graphs having no __K__~3,3~ minor, and consequently for planar graphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 293–298, 2008