Induced matching extendable graph powers

DOI10.1007/S00373-006-0673-0zbMATH Open1106.05078OpenAlexW2013278241MaRDI QIDQ855304FDOQ855304

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

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

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)

Cites Work

• Induced matchings in bipartite graphs
• Induced matchings
• Degree conditions of induced matching extendable graphs
• Independent-set-deletable factor-critical power graphs
• Title not available (Why is that?)
• Maximal IM-unextendable graphs

Cited In (9)

• Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.
• Title not available (Why is that?)
• Title not available (Why is that?)
• General induced matching extendability of \(G^3\)
• 4-regular claw-free IM-extendable graphs
• A result on extendibility in the powers of graphs
• 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
• A note on characterization of the induced matching extendable Cayley graphs generated by transpositions

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)