Maximal IM-unextendable graphs

DOI10.1016/S0012-365X(01)00205-9MaRDI QIDQ5948988zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Induced matchings, maximal IM-extendable graphs and induced matching number
• scientific article; zbMATH DE number 1286491
• scientific article; zbMATH DE number 2230936
• Characterization of the induced matching extendable graphs with 2 n vertices and 3 n edges
• Degree conditions of induced matching extendable graphs

Cited in

(11)

• Edge-deletable IM-extendable graphs with minimum number of edges
• Characterization of the induced matching extendable graphs with 2 n vertices and 3 n edges
• 4-regular claw-free IM-extendable graphs
• A note on characterization of the induced matching extendable Cayley graphs generated by transpositions
• scientific article; zbMATH DE number 7499157 (Why is no real title available?)
• Induced matchings, maximal IM-extendable graphs and induced matching number
• scientific article; zbMATH DE number 1827735 (Why is no real title available?)
• Induced matching extendable graph powers
• A characterization of maximal non-\(k\)-factor-critical graphs
• Characterizing defect n-extendable bipartite graphs with different connectivities
• Bipartite matching extendable graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948988)