On almost 1-extendable graphs

MaRDI QIDQ5393538zbMATH OpenFDO

Authors Lutz Volkmann

Publication date 18 April 2011

zbMATH Keywords

1-extendable graphalmost 1-extendable graphalmost perfect matchingperfect matching

Mathematics Subject Classification ID

Perfect graphs (05C17)

Recommendations

• The smallest regular graphs which are not 1-extendable.
• On regular (1,q)-extendable graphs
• scientific article; zbMATH DE number 5053297
• scientific article; zbMATH DE number 2104722
• scientific article; zbMATH DE number 2197893

Cited in

(8)

• Zero-dimensional almost 1-1 extensions of odometers from graph coverings
• On strongly k-extendable graphs
• scientific article; zbMATH DE number 1263931 (Why is no real title available?)
• scientific article; zbMATH DE number 927057 (Why is no real title available?)
• The smallest regular graphs which are not 1-extendable.
• Countable \(\alpha\)-extendable graphs
• Removable ears of 1-extendable graphs
• A lower bound on the number of removable ears of 1-extendable graphs

This page was built for publication: On almost 1-extendable graphs

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