Disjoint essential cycles
type: Item
instance of: scholarly article
title: Disjoint essential cycles
zbMATH Open document ID: 0861.05038
author: Neil Robertson
author: Bojan Mohar
published in: Journal of Combinatorial Theory. Series B
publication date: 1996-12-08T00:00:00Z
review text: Graphs that have two disjoint noncontractible cycles in every possible embedding in surfaces are characterized. Similar characterization is given for the class of graphs whose orientable embeddings (embeddings in surfaces different from the projective plane, respectively) always have two disjoint noncontractible cycles. For graphs which admit embeddings in closed surfaces without having two disjoint noncontractible cycles, such embeddings are characterized in terms of their geometric structure. This result shows close relationship with Dirac's characterization of graphs which do not have two disjoint cycles.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 954832
zbMATH Keywords: noncontractible cycles
zbMATH Keywords: embedding
zbMATH Keywords: closed surfaces
zbMATH Keywords: disjoint cycles
reviewed by: Bojan Mohar
MaRDI profile type: Publication
OpenAlex ID: W2087502175
DOI: 10.1006/JCTB.1996.0073
Recommended article: Q4694737
Recommended article: ON DISJOINT CYCLES
Recommended article: A note on disjoint cycles
Recommended article: Disjoint directed cycles
Recommended article: Disjointness in hypercyclicity
Recommended article: Disjoint chorded cycles in graphs
Recommended article: Disjoint cycles with chords in graphs
Recommended article: Q5036301
Recommended article: Disjoint long cycles in a graph
Recommended article: Disjoint Chorded Cycles of the Same Length
description: scientific article; zbMATH DE number 954832