On regular (2,q)-extendable graphs.

MaRDI QIDQ4924879zbMATH OpenFDO

Authors Lutz Volkmann

Publication date 10 June 2013

zbMATH Keywords

\((p,q)\)-extendable graphmatchingregular graph

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(7)

• On extendability of co-edge-regular graphs
• On extendability of Deza graphs with diameter 2
• On the extendability of quasi-strongly regular graphs with diameter 2
• On regular (1,q)-extendable graphs
• The smallest regular graphs which are not 1-extendable.
• Max-cut and extendability of matchings in distance-regular graphs
• The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)

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

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