The extendability of matchings in strongly regular graphs

zbMath1300.05329MaRDI QIDQ405235

Sebastian M. Cioabă, Weiqiang Li

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p34

zbMATH Keywords

strongly regular graphsextendabilitymatchingsblock graphs of Steiner systemsLatin square graphstriangular graphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Related Items

On the extendability of quasi-strongly regular graphs with diameter 2, Minimal graphs for matching extensions, The extendability of Cayley graphs generated by transpositions, The classification of \(2\)-extendable edge-regular graphs with diameter \(2\), Max-cut and extendability of matchings in distance-regular graphs, The cyclic edge-connectivity of strongly regular graphs, On extendability of co-edge-regular graphs, Matching extendability and connectivity of regular graphs from eigenvalues, The chromatic index of strongly regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the connectedness of the complement of a ball in distance-regular graphs
• Exponentially many perfect matchings in cubic graphs
• Spectra of graphs
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• Distance regular graphs of diameter 3 and strongly regular graphs
• 5-chromatic strongly regular graphs
• Matchings in regular graphs from eigenvalues
• The vertex-connectivity of a distance-regular graph
• The connectivity of strongly regular graphs
• On n-extendable graphs
• Spherical codes and designs
• On matching extensions with prescribed and proscribed edge sets. II
• Extending matchings in graphs: A survey
• Matchings and matching extensions in graphs
• Eigenvalues and perfect matchings
• The 2-extendability of strongly regular graphs
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Disconnecting strongly regular graphs
• Results and open problems in matchings in regular graphs
• Recent Progress in Matching Extension
• Graph Factors and Matching Extensions
• The uniqueness of the strongly regular graph on 77 points
• N‐extendability of symmetric graphs
• On the structure of factorizable graphs. II
• The Factorization of Linear Graphs
• Random strongly regular graphs?