𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding Paths and Cycles of Superpolylogarithmic Length

✍ Scribed by Gabow, Harold N.


Book ID
118181321
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
288 KB
Volume
36
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Finding and listing induced paths and cy
✍ HoΓ ng, ChΓ­nh T.; KamiΕ„ski, Marcin; Sawada, Joe; Sritharan, R. πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 230 KB
On relative length of longest paths and
✍ Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

## Abstract For a graph __G__, __p__(__G__) and __c__(__G__) denote the order of a longest path and a longest cycle of __G__, respectively. In this paper, we prove that if __G__ is a 3 ‐connected graph of order __n__ such that the minimum degree sum of four independent vertices is at least __n__+ 6

Long paths, long cycles, and their relat
✍ Saito, Akira πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 1 views

Let p(G) and c(G) be the order of a longest path and a longest cycle in a graph G, respectively. Let Οƒ 3 (G) = min{deg G x + deg G y + deg G z : {x, y, z} is an independent set of vertices of G}. Extending the result by Enomoto et al. (J Graph Th 20 (1995), 213-225) on the difference p(G) -c(G), we

Finding a Path of Superlogarithmic Lengt
✍ BjΓΆrklund, Andreas; Husfeldt, Thore πŸ“‚ Article πŸ“… 2003 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 165 KB