The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)

zbMath1409.05160MaRDI QIDQ668067

Primož Šparl, Klavdija Kutnar, Dragan Marušič, Štefko Miklavič

Publication date: 5 March 2019

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

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

Mathematics Subject Classification ID

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

Related Items (2)

The extendability of Cayley graphs generated by transpositions ⋮ On extendability of co-edge-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The extendability of matchings in strongly regular graphs
• Max-cut and extendability of matchings in distance-regular graphs
• On n-extendable graphs
• Extending matchings in graphs: A survey
• On regular factors in regular graphs with small radius
• Edge-girth-regular graphs
• On 2-extendable abelian Cayley graphs
• The 2-extendability of strongly regular graphs
• On extendability of Deza graphs with diameter 2
• On the extendability of quasi-strongly regular graphs with diameter 2
• Notes on factor-criticality, extendibility and independence number
• On quasi-strongly regular graphs
• Maximum degree in graphs of diameter 2
• Hamiltonian cycles in n‐extendable graphs
• Regular clique assemblies, configurations, and friendship in Edge-Regular graphs
• On extendability of Cayley graphs

This page was built for publication: The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)