On extendability of co-edge-regular graphs
From MaRDI portal
Publication:2028079
DOI10.1016/j.dam.2021.03.018zbMath1465.05144OpenAlexW3153428150MaRDI QIDQ2028079
Primož Šparl, Dragan Marušič, Štefko Miklavič, Klavdija Kutnar
Publication date: 31 May 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.03.018
Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)
- A table of connected graphs on six vertices
- On n-extendable graphs
- Extending matchings in graphs: A survey
- On regular factors in regular graphs with small radius
- 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
- Recent Progress in Matching Extension
- Hamiltonian cycles in n‐extendable graphs
- On extendability of Cayley graphs
This page was built for publication: On extendability of co-edge-regular graphs