scientific article; zbMATH DE number 166088

MaRDI QIDQ4033701zbMATH OpenFDO

Authors Derek Holton, Dingjun Lou

Publication date 16 May 1993

zbMATH Keywords

matchingstrongly regular graphconnectivity

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The 2-extendability of strongly regular graphs
• The extendability of matchings in strongly regular graphs
• scientific article; zbMATH DE number 205826
• On strongly \(k\)-extendable graphs
• On the extendability of quasi-strongly regular graphs with diameter 2

Cited in

(16)

• On strongly regular signed graphs
• The extendability of matchings in strongly regular graphs
• Graph extensions, edit number and regular graphs
• On extendability of Deza graphs with diameter 2
• On the extendability of quasi-strongly regular graphs with diameter 2
• scientific article; zbMATH DE number 205826 (Why is no real title available?)
• The 2-extendability of strongly regular graphs
• On extension of regular graphs
• The edge-connectivity of strongly 3-walk-regular graphs
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• On extendability of co-edge-regular graphs
• Matching extendability and connectivity of regular graphs from eigenvalues
• scientific article; zbMATH DE number 6828923 (Why is no real title available?)
• Matching extension in prism graphs
• The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)
• Max-cut and extendability of matchings in distance-regular graphs

This page was built for publication:

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