Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges

DOI10.1016/j.disc.2017.12.013zbMath1380.05166OpenAlexW2794034122MaRDI QIDQ1699544

Ju Zhou

Publication date: 23 February 2018

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

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

zbMATH Keywords

matchingperfect matchinginduced matchinginduced matching extendable

Mathematics Subject Classification ID

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

Related Items

A note on characterization of the induced matching extendable Cayley graphs generated by transpositions ⋮ Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 ⋮ Distance matching extension in cubic bipartite graphs

Cites Work

• Induced matching extendable graph powers
• Edge-deletable IM-extendable graphs with minimum number of edges
• Induced matchings
• 4-regular claw-free IM-extendable graphs
• Degree conditions of induced matching extendable graphs
• Maximal IM-unextendable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item