scientific article; zbMATH DE number 166075

zbMATH Open0774.05076MaRDI QIDQ4033684FDOQ4033684

Authors: R. E. L. Aldred, Xingxing Yu, R. L. Hemminger 

Publication date: 16 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• The 3‐connected graphs with a maximum matching containing precisely one contractible edge
• scientific article; zbMATH DE number 4043878
• Publication:4863509
• Contractible edges and removable edges in 3-connected graphs
• Contractible edges in subgraphs of \(2\)-connected graphs

zbMATH Keywords

maximum matchingcontractible edge

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cited In (9)

• Minimal locally cyclic triangulations of the projective plane
• Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
• The 3‐connected graphs with a maximum matching containing precisely one contractible edge
• Title not available (Why is that?)
• On edge contractible graphs.
• Contractible edges in longest cycles
• Contractible edges in subgraphs of \(2\)-connected graphs
• Contractible edges and removable edges in 3-connected graphs
• A longest cycle version of Tutte's wheels theorem

This page was built for publication:

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