scientific article; zbMATH DE number 1286491
From MaRDI portal
Publication:4242938
Recommendations
Cited in
(25)- 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
- Partition the vertices of a graph into induced matchings
- Degree conditions of induced matching extendable graphs
- Distance matching extension in cubic bipartite graphs
- Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3
- 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 5926811 (Why is no real title available?)
- scientific article; zbMATH DE number 6007655 (Why is no real title available?)
- scientific article; zbMATH DE number 7499157 (Why is no real title available?)
- Induced matchings, maximal IM-extendable graphs and induced matching number
- Induced matching extendability of quasi-wheel graphs
- scientific article; zbMATH DE number 736426 (Why is no real title available?)
- scientific article; zbMATH DE number 1471760 (Why is no real title available?)
- scientific article; zbMATH DE number 1827735 (Why is no real title available?)
- scientific article; zbMATH DE number 2230936 (Why is no real title available?)
- Maximal IM-unextendable graphs
- The extendability of Cayley graphs generated by transpositions
- Uniquely restricted matching extendable graphs
- Induced matching extendable graph powers
- A characterization of maximal non-\(k\)-factor-critical graphs
- Characterizing defect n-extendable bipartite graphs with different connectivities
- Bipartite matching extendable graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242938)
