Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs

DOI10.1137/060665956zbMATH Open1151.05031OpenAlexW1974229618MaRDI QIDQ3544252FDOQ3544252

Authors: Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi 

Publication date: 5 December 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060665956

Recommendations

• Contractible edges in non-separating cycles
• Nonseparating cycles avoiding specific vertices
• scientific article; zbMATH DE number 568792
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Contractible cycles in graphs with girth at least 5

zbMATH Keywords

\(k\)-connected graphscontractible edgenonseparating cycle

Mathematics Subject Classification ID

Connectivity (05C40)

Cited In (7)

• Contractible cycles in graphs with girth at least 5
• Contractible edges in longest cycles in non-Hamiltonian graphs
• Non-separating cycles and discrete Jordan curves
• Note on non-separating and removable cycles in highly connected graphs
• Algorithms – ESA 2005
• Chromatic number, induced cycles, and non-separating cycles
• Nonseparating cycles avoiding specific vertices

This page was built for publication: Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs

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