Nonseparating Cycles Avoiding Specific Vertices
From MaRDI portal
Publication:3466341
DOI10.1002/jgt.21845zbMath1330.05088OpenAlexW1582543359MaRDI QIDQ3466341
Xingxing Yu, Yanmei Hong, Li-ying Kang
Publication date: 1 February 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21845
Cites Work
- Unnamed Item
- Unnamed Item
- Non-separating cycles and discrete Jordan curves
- A weaker version of Lovász' path removal conjecture
- Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
- Contractible cycles in graphs with girth at least 5
- An improved linear edge bound for graph linkages
- Non-separating paths in 4-connected graphs
- Graph connectivity after path removal
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Highly linked graphs
- Induced paths in 5-connected graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- Nonseparating cycles inK-Connected graphs
- Uncontractable 4-connected graphs
This page was built for publication: Nonseparating Cycles Avoiding Specific Vertices