Maximal IM-unextendable graphs

DOI10.1016/S0012-365X(01)00205-9zbMath0982.05078OpenAlexW2034615559WikidataQ127754401 ScholiaQ127754401MaRDI QIDQ5948988

Jinjiang Yuan, Qin Wang

Publication date: 29 March 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00205-9

zbMATH Keywords

extendableinduced matching

Mathematics Subject Classification ID

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

Related Items (9)

Induced matching extendable graph powers ⋮ A characterization of maximal non-\(k\)-factor-critical graphs ⋮ Characterizing defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges ⋮ A note on characterization of the induced matching extendable Cayley graphs generated by transpositions ⋮ Unnamed Item ⋮ 4-regular claw-free IM-extendable graphs ⋮ Bipartite matching extendable graphs ⋮ Edge-deletable IM-extendable graphs with minimum number of edges

This page was built for publication: Maximal IM-unextendable graphs