Separating and nonseparating disjoint homotopic cycles in graph embeddings

20Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that if a graph G is embedded in a surface ∑ with representativity ρ, then G contains at least ⌊(ρ - 1)/2⌋ pairwise disjoint, pairwise homotopic, non-separating (in ∑) cycles, and G contains at least ⌊(ρ - 1)/8⌋ - 1 pairwise disjoint, pairwise homotopic, separating, noncontractible cycles. © 1996 Academic Press, Inc.

Cite

CITATION STYLE

APA

Brunet, R., Mohar, B., & Richter, R. B. (1996). Separating and nonseparating disjoint homotopic cycles in graph embeddings. Journal of Combinatorial Theory. Series B, 66(2), 201–231. https://doi.org/10.1006/jctb.1996.0016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free