On (2n+1)-contractible graphs and 2n-pairs contractible graphs

zbMATH Open1199.05286MaRDI QIDQ3404599FDOQ3404599

Authors: Hong Lin, Xiaofeng Guo 

Publication date: 12 February 2010

Recommendations

• On edge contractible graphs.
• The 3‐connected graphs with a maximum matching containing precisely one contractible edge
• A novel characterization of \(n\)-extendable bipartite graphs.
• Publication:4863509
• scientific article; zbMATH DE number 871171

zbMATH Keywords

\(k\)-critical graphs\(n\)-extendable graphs\((2n+1)\)-contractible graphs\(2n\)-pairs contractible graphs

Mathematics Subject Classification ID

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

Cited In (2)

• On edge contractible graphs.
• A novel characterization of \(n\)-extendable bipartite graphs.

This page was built for publication: On \((2n+1)\)-contractible graphs and \(2n\)-pairs contractible graphs

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