4-regular claw-free IM-extendable graphs

DOI10.1016/j.disc.2004.11.009zbMath1062.05122OpenAlexW1996424691MaRDI QIDQ1781983

Jinjiang Yuan, Qin Wang

Publication date: 10 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.11.009

zbMATH Keywords

perfect matchingInduced matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

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 ⋮ Edge-deletable IM-extendable graphs with minimum number of edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced matchings in bipartite graphs
• Matching theory
• Induced matchings
• Degree conditions of induced matching extendable graphs
• Independent-set-deletable factor-critical power graphs
• Maximal IM-unextendable graphs

This page was built for publication: 4-regular claw-free IM-extendable graphs