On regular (1,q)-extendable graphs

zbMATH Open1214.05136MaRDI QIDQ3059005FDOQ3059005

Authors Lutz Volkmann

Publication date 8 December 2010

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On regular \((2,q)\)-extendable graphs.
• The smallest regular graphs which are not 1-extendable.
• Matchings and matching extensions in graphs
• scientific article; zbMATH DE number 871171
• scientific article; zbMATH DE number 734454

Cited in

(4)

• On almost 1-extendable graphs
• The smallest regular graphs which are not 1-extendable.
• Max-cut and extendability of matchings in distance-regular graphs
• On regular \((2,q)\)-extendable graphs.

This page was built for publication: On regular \((1,q)\)-extendable graphs

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