scientific article

zbMath0770.05099MaRDI QIDQ4033701

Dingjun Lou, Derek Holton

Publication date: 16 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

strongly regular graphmatchingconnectivity

Mathematics Subject Classification ID

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

Related Items (10)

Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ The 2-extendability of strongly regular graphs ⋮ On the extendability of quasi-strongly regular graphs with diameter 2 ⋮ The extendability of matchings in strongly regular graphs ⋮ The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ On strongly regular signed graphs ⋮ On extendability of co-edge-regular graphs ⋮ Matching extendability and connectivity of regular graphs from eigenvalues ⋮ On extendability of Deza graphs with diameter 2

This page was built for publication: