On removable cycles in connected graphs.

MaRDI QIDQ5199104zbMATH OpenFDO

Authors Y. M. Borse, B. N. Waphare

Publication date 11 August 2011

zbMATH Keywords

connected graphremovable cycle

Mathematics Subject Classification ID

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

Recommendations

• Removable cycles avoiding two connected subgraphs
• On removable cycles through every edge
• On removable even circuits in graphs
• Removable edges in cycles of a k-connected graph
• On removable cycles in graphs and digraphs

Cited in

(16)

• Removable matchings and Hamiltonian cycles
• Cycles having the same modularity and removable edges in 2-connected graphs
• On removable even circuits in graphs
• Removable cycles avoiding two connected subgraphs
• Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
• Removable cycles in non-bipartite graphs
• On removable and non-separating even cycles in graphs
• Upon the existence of a removable circuit in a simple 3-connected Eulerian graph
• Vertex removable cycles of graphs and digraphs
• Vertex disjoint non-separating cycles in graphs
• Removable Cycles in Planar Graphs
• scientific article; zbMATH DE number 4110733 (Why is no real title available?)
• scientific article; zbMATH DE number 2065937 (Why is no real title available?)
• On removable cycles in graphs and digraphs
• Removable and forced subgraphs of graphs
• Removable edges of cycles in 5-connected graphs

This page was built for publication: On removable cycles in connected graphs.

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