Induced matching extendable graph powers

DOI10.1007/S00373-006-0673-0zbMath1106.05078OpenAlexW2013278241MaRDI QIDQ855304

Jian Guo Qian

Publication date: 5 January 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0673-0

zbMATH Keywords

IM-extendable

Mathematics Subject Classification ID

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

Related Items (4)

Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges ⋮ A note on characterization of the induced matching extendable Cayley graphs generated by transpositions ⋮ Unnamed Item ⋮ Edge-deletable IM-extendable graphs with minimum number of edges

Cites Work

• Unnamed Item
• Induced matchings in bipartite graphs
• Induced matchings
• Degree conditions of induced matching extendable graphs
• Independent-set-deletable factor-critical power graphs
• Maximal IM-unextendable graphs

This page was built for publication: Induced matching extendable graph powers