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

Bondy, 1976 Cameron, 1989, Induced matchings, Discrete Appl. Math., 24, 97, 10.1016/0166-218X(92)90275-F Liu, 2000, Degree conditions of IM-extendable graphs, Appl. Math. JCU, 15B, 1 Qian, 2006, Induced matching extendable graph powers, Graphs Combin., 391, 10.1007/s00373-006-0673-0 Wang, 2000, Degree sum conditions of induced matching extendable graphs, J. Zhengzhou Univ., 32, 19 Wang, 2001, Maximal IM-extendable graphs, Discrete Math., 240, 295, 10.1016/S0012-365X(01)00205-9 Wang, 2005, 4-regular claw-free IM-extendable graphs, Discrete Math., 294, 303, 10.1016/j.disc.2004.11.009 Wang, 2009, Edge-deletable IM-extendable graphs with minimum number of edges, Discrete Math., 309, 5242, 10.1016/j.disc.2009.03.048 Yang, 1998, Induced matching extendable graphs without K4 minor, Adv. Oper. Res. Syst. Eng., 142 Yang, 1999, IM-extendable claw-free graphs, J. Math. Study, 32, 33 Yang, 2000, NP-completeness of induced matching problem and co-NP-completeness of induced matching extendable problem, OR Trans., 4, 76 Yuan, 1998, Induced matching extendable graph, J. Graph Theory, 28, 203, 10.1002/(SICI)1097-0118(199808)28:4<203::AID-JGT2>3.0.CO;2-N Yuan, 1999, Degree conditions of induced matching extendable bipartite graphs, Henan Sci., 17, 7 Zhou, 2003, Induced matching extendability of claw free graphs of diameter 2, J. Zhengzhou Univ. Nat. Sci. Ed., 35, 12 Zhou, 2005, Characterization of induced matching extendable graphs with 2n vertices and 3n−1 edges, Austr. J. Combin., 33, 255