The smallest regular graphs which are not 1-extendable.

MaRDI QIDQ4909689zbMATH OpenFDO

Authors Lutz Volkmann

Publication date 21 March 2013

zbMATH Keywords

perfect matchingregular graph1-extendable graph

Mathematics Subject Classification ID

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

Recommendations

• On almost 1-extendable graphs
• On regular \((1,q)\)-extendable graphs
• On regular \((2,q)\)-extendable graphs.
• scientific article; zbMATH DE number 637274
• scientific article; zbMATH DE number 2197893

Cited in

(4)

• On almost 1-extendable graphs
• On regular \((2,q)\)-extendable graphs.
• On regular \((1,q)\)-extendable graphs
• A smallest irregular oriented graph containing a given diregular one

This page was built for publication: The smallest regular graphs which are not 1-extendable.

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