𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings

✍ Scribed by Richard Brunet; Bojan Mohar; R.Bruce Richter

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
1023 KB
Volume
66
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disjoint Hamilton cycles in the random g
Disjoint Hamilton cycles in the random geometric graph
✍ Tobias MΓΌller,; Xavier PΓ©rez-GimΓ©nez;; Nicholas Wormald πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 270 KB

We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge-length. For fixed k β‰₯ 1, we prove that the first edge in the process that creates a k-connected graph coincides a.a.s. with

Vertex-disjoint cycles containing specif
Vertex-disjoint cycles containing specified vertices in a bipartite graph
✍ Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

## Abstract A minimum degree condition is given for a bipartite graph to contain a 2‐factor each component of which contains a previously specified vertex. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 145–166, 2004

Nearly light cycles in embedded graphs a
Nearly light cycles in embedded graphs and crossing-critical graphs
✍ Mario LomelΓ­; Gelasio Salazar πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 101 KB

## Abstract We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly light (that is, they have bounded length and at most one vertex of large degree). As an application, we show that every sufficiently large __k__‐crossing‐critical graph has crossing number a

Edge-disjoint paths and cycles in n-edge
Edge-disjoint paths and cycles in n-edge-connected graphs
✍ Andreas Huck πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 826 KB

## Abstract We consider finite undirected loopless graphs __G__ in which multiple edges are possible. For integers k,l β‰₯ 0 let g(k, l) be the minimal __n__ β‰₯ 0 with the following property: If __G__ is an __n__‐edge‐connected graph, __s__~1~, ⃛,__s__~k~, __t__~1~, ⃛,__t__~k~ are vertices of __G__, a