Induced matching extendable graph powers

DOI10.1007/S00373-006-0673-0MaRDI QIDQ855304zbMATH OpenOpenAlexFDO

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

Recommendations

• General induced matching extendability of G^3
• scientific article; zbMATH DE number 1286491
• Characterization of the induced matching extendable graphs with 2 n vertices and 3 n edges
• Degree conditions of induced matching extendable graphs
• scientific article; zbMATH DE number 2230936

Cites work

• Degree conditions of induced matching extendable graphs
• scientific article; zbMATH DE number 1286491 (Why is no real title available?)
• Independent-set-deletable factor-critical power graphs
• Induced matchings
• Induced matchings in bipartite graphs
• Maximal IM-unextendable graphs

Cited in

(9)

• 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
• General induced matching extendability of G^3
• scientific article; zbMATH DE number 6007655 (Why is no real title available?)
• Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.
• scientific article; zbMATH DE number 7499157 (Why is no real title available?)
• A result on extendibility in the powers of graphs

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

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