Contractible edges and removable edges in 3-connected graphs

DOI10.1007/s00373-019-02103-5zbMath1431.05093OpenAlexW2976396624WikidataQ127215106 ScholiaQ127215106MaRDI QIDQ2287731

Xiaofeng Guo, Li Qiong Xu

Publication date: 21 January 2020

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

Full work available at URL: https://doi.org/10.1007/s00373-019-02103-5

zbMATH Keywords

connectivityspanning treemaximum matchingcontractible edgeremovable edge

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (1)

Contractible Edges in 3-Connected Cubic Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On removable edges in 3-connected cubic graphs
• Contractible edges in triangle-free graphs
• Contractible edges in 3-connected graphs
• The number of contractible edges in 3-connected graphs
• Distribution of contractible edges in k-connected graphs
• The number of removable edges in 3-connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
• Removable edges and chords of longest cycles in 3-connected graphs
• Zur Theorie der n-fach zusammenhängenden Graphen
• Removable edges in 3-connected graphs
• Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs
• Longest cycles in 3-connected graphs contain three contractible edges
• Kuratowski's theorem
• The 3‐connected graphs having a longest cycle containing only three contractible edges
• The 3‐connected graphs with a maximum matching containing precisely one contractible edge
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge

This page was built for publication: Contractible edges and removable edges in 3-connected graphs