Removable cycles avoiding two connected subgraphs (Q1952658): Difference between revisions
From MaRDI portal
Latest revision as of 12:14, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Removable cycles avoiding two connected subgraphs |
scientific article |
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
