𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Length-constrained path-matchings in graphs

✍ Scribed by M. Ghodsi; M. T. Hajiaghayi; M. Mahdian; V. S. Mirrokni

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
114 KB
Volume
39
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings in Graphs on Non-orientable Su
Matchings in Graphs on Non-orientable Surfaces
✍ Glenn Tesler 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to graphs embedding on an arbitrary compact boundaryless 2-manifold S. Kasteleyn stated that perfect matchings in a graph embedding on a surface of genus g could be enumerated as a linear combination of 4 g Pfaff

Relative length of longest paths and cyc
Relative length of longest paths and cycles in 3-connected graphs
✍ Rao Li; Akira Saito; R.H. Schelp 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 2 views

## Abstract For a graph __G__, let __p(G)__ denote the order of a longest path in __G__ and __c(G)__ the order of a longest cycle in __G__, respectively. We show that if __G__ is a 3‐connected graph of order __n__ such that $\textstyle{\sum^{4}\_{i=1}\,{\rm deg}\_{G}\,x\_{i} \ge {3\over2}\,n + 1}$

Decompositions of highly connected graph
Decompositions of highly connected graphs into paths of length 3
✍ Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

## Abstract We prove that a 171‐edge‐connected graph has an edge‐decomposition into paths of length 3 if and only its size is divisible by 3. It is a long‐standing problem whether 2‐edge‐connectedness is sufficient for planar triangle‐free graphs, and whether 3‐edge‐connectedness suffices for graph