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

DOI10.1137/060665956MaRDI QIDQ3544252zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(k\)-connected graphscontractible edgenonseparating cycle

Mathematics Subject Classification ID

Connectivity (05C40)

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

Cited in

(9)

• Note on non-separating and removable cycles in highly connected graphs
• Contractible edges in longest cycles in non-Hamiltonian graphs
• Contractible cycles in graphs with large minimum degree
• Contractible cycles in graphs with girth at least 5
• Chromatic number, induced cycles, and non-separating cycles
• Nonseparating cycles avoiding specific vertices
• scientific article; zbMATH DE number 568792 (Why is no real title available?)
• Algorithms – ESA 2005
• Non-separating cycles and discrete Jordan curves

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)