Non-contractible non-edges in 2-connected graphs

DOI10.1016/j.ipl.2010.09.005zbMath1379.05067OpenAlexW2008675143MaRDI QIDQ1675819

Mathew C. Francis, Anita Das, Rogers Mathew, N. Sadagopan

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.09.005

zbMATH Keywords

contractioncombinatorial problemsconnectivitycontractible edges/non-edges

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (2)

Contractible non-edges in 3-connected infinite graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractible edges in 3-connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Contractible non-edges in \(3\)-connected graphs
• Contractible non-edges in triangle-free graphs
• Nonseparating cycles inK-Connected graphs

This page was built for publication: Non-contractible non-edges in 2-connected graphs