Removable cycles avoiding two connected subgraphs

DOI10.1155/2013/164535zbMath1264.05071OpenAlexW2058110017WikidataQ58992853 ScholiaQ58992853MaRDI QIDQ1952658

B. N. Waphare, Y. M. Borse

Publication date: 3 June 2013

Published in: ISRN Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/164535

zbMATH Keywords

removable cyclescycles edge disjoint from subgraphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Note on non-separating and removable cycles in highly connected graphs
• Removable circuits in multigraphs
• On removable even circuits in graphs
• Kreuzungsfreie a,b-Wege in endlichen Graphen
• Removable Cycles in Planar Graphs
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
• On removable circuits in graphs and matroids
• Even cycles in graphs
• On removable cycles through every edge

This page was built for publication: Removable cycles avoiding two connected subgraphs