The characterization of 1-edge deletable IM-extendable graphs

zbMATH Open1150.05391MaRDI QIDQ3501196FDOQ3501196

Authors: Sujing Zhou, Xiumei Wang 

Publication date: 3 June 2008

Recommendations

• \(n\)-regular \((n-2)\)-edge deletable IM-extendable graphs
• Edge-deletable IM-extendable graphs with minimum number of edges
• Group connectivity of 1-edge deletable IM-extendable graphs
• scientific article; zbMATH DE number 5926811
• Publication:4489771

zbMATH Keywords

induced matchingextendable graph1-edge-deletable

Mathematics Subject Classification ID

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

Cited In (4)

• A property of claw-free graphs
• \(n\)-regular \((n-2)\)-edge deletable IM-extendable graphs
• Edge-deletable IM-extendable graphs with minimum number of edges
• Group connectivity of 1-edge deletable IM-extendable graphs

This page was built for publication: The characterization of 1-edge deletable IM-extendable graphs

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