Nonseparating cycles avoiding specific vertices

DOI10.1002/JGT.21845MaRDI QIDQ3466341zbMATH OpenOpenAlexFDO

Authors Yanmei Hong, Xingxing Yu, Liying 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

zbMATH Keywords

connectivity\(k\)-contractible edgenonseparating cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 568792
• Nonseparating Cycles in 4-Connected Graphs
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Note on non-separating and removable cycles in highly connected graphs
• Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs

Cites work

• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 1341915 (Why is no real title available?)
• A weaker version of Lovász' path removal conjecture
• An improved linear edge bound for graph linkages
• Contractible cycles in graphs with girth at least 5
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen
• Graph connectivity after path removal
• Graph decomposition with applications to subdivisions and path systems modulo k
• Highly linked graphs
• Induced paths in 5-connected graphs
• Non-separating cycles and discrete Jordan curves
• Non-separating paths in 4-connected graphs
• Nonseparating cycles inK-Connected graphs
• Uncontractable 4-connected graphs

Cited in

(12)

• Removable paths and cycles with parity constraints
• Non-separating subgraphs
• Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs
• A weaker version of Lovász' path removal conjecture
• Nonseparating Cycles in 4-Connected Graphs
• Linkages and removable paths avoiding vertices
• Induced paths in 5-connected graphs
• Non-separating subgraphs in highly connected graphs
• Non-separating cycles and discrete Jordan curves
• Note on non-separating and removable cycles in highly connected graphs
• Chromatic number, induced cycles, and non-separating cycles
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph

This page was built for publication: Nonseparating cycles avoiding specific vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466341)