N‐extendability of symmetric graphs
From MaRDI portal
Publication:4693362
DOI10.1002/jgt.3190170213zbMath0784.05050OpenAlexW2117515252MaRDI QIDQ4693362
Dingjun Lou, Derek Holton, R. E. L. Aldred
Publication date: 1 February 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170213
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ The 2-extendability of strongly regular graphs ⋮ Extending matchings in planar graphs. V ⋮ The extendability of matchings in strongly regular graphs ⋮ The extendability of Cayley graphs generated by transpositions ⋮ A local independence number condition for \(n\)-extendable graphs ⋮ Extending matchings in graphs: A survey
Cites Work