✦ LIBER ✦

A Note on Observables for Counting Trails and Paths in Graphs

✍ Scribed by Fotini Markopoulou; Simone Severini

Publisher: Springer Netherlands
Year: 2009
Tongue: English
Weight: 265 KB
Volume: 8
Category: Article
ISSN: 1570-1166
DOI: 10.1007/s10852-009-9111-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on monotone paths in labeled grap

A note on monotone paths in labeled graphs

✍ Jan Reiterman 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 81 KB

A note on packing paths in planar graphs

✍ András Frank; Zoltán Szigeti 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 506 KB

A note on path and cycle decompositions

A note on path and cycle decompositions of graphs

✍ Dom Decaen 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

## Abstract In the study of decompositions of graphs into paths and cycles, the following questions have arisen: Is it true that every graph __G__ has a smallest path (resp. path‐cycle) decomposition __P__ such that every odd vertex of __G__ is the endpoint of exactly one path of __P__? This note g

A theorem on paths in planar graphs

✍ Norishige Chiba; Takao Nishizeki 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

C. Thomassen extended Tutte's theorem on cycles in planar graphs in the paper "A Theorem on Paths in Planar Graphs". This note corrects a flaw in his proof.

A theorem on paths in planar graphs

✍ Carsten Thomassen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB 👁 1 views

We prove a theorem on paths with prescribed ends in a planar graph which extends Tutte's theorem on cycles in planar graphs [9] and implies the conjecture of Plummer (51 asserting that every 4-connected planar graph is Hamiltonian-connected.

Algorithms and outerplanar conditions fo

Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs

✍ Lars Døvling Andersen; Herbert Fleischner; Susanne Regner 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 834 KB

The problem of finding A-trails in plane Eulerian graphs is &'P-complete even for 3-connected graphs, as shown by the first two authors in an earlier paper. In the present paper, we discuss sufficient conditions for the existence of an A-trail in a 2-connected plane Eulerian graph. They generalize t