Removable cycles avoiding two connected subgraphs (Q1952658)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Removable cycles avoiding two connected subgraphs |
scientific article; zbMATH DE number 6169684
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Removable cycles avoiding two connected subgraphs |
scientific article; zbMATH DE number 6169684 |
Statements
Removable cycles avoiding two connected subgraphs (English)
0 references
3 June 2013
0 references
Summary: We provide a sufficient condition for the existence of a cycle \(C\) in a connected graph \(G\) which is edge-disjoint from two connected subgraphs \(H_1\) and \(H_2\) of \(G\) such that \(G-E(C)\) is connected.
0 references
removable cycles
0 references
cycles edge disjoint from subgraphs
0 references
