Edge-deletable IM-extendable graphs with minimum number of edges

DOI10.1016/j.disc.2009.03.048zbMath1213.05142OpenAlexW1975923241MaRDI QIDQ1045004

Jinjiang Yuan, Xiumei Wang, Sujing Zhou

Publication date: 15 December 2009

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

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

zbMATH Keywords

induced matchingIM-extendable\(k\)-edge-deletable IM-extendable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges ⋮ Minimum \(k\)-critical bipartite graphs

Cites Work

• Induced matching extendable graph powers
• Induced matchings
• 4-regular claw-free IM-extendable graphs
• Degree conditions of induced matching extendable graphs
• The Factorization of Linear Graphs
• Maximal IM-unextendable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-deletable IM-extendable graphs with minimum number of edges