Forbidden pairs for equality of connectivity and edge-connectivity of graphs

DOI10.1007/s00373-018-2003-8zbMath1409.05121OpenAlexW2906907771MaRDI QIDQ1741581

Shipeng Wang, Shoichi Tsuchiya, Limning Xiong

Publication date: 3 May 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-2003-8

zbMATH Keywords

forbidden subgraphedge connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Characterizing forbidden pairs for hamiltonian properties
• Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden pairs and the existence of a dominating cycle

This page was built for publication: Forbidden pairs for equality of connectivity and edge-connectivity of graphs