Matching extendability in Cartesian product of hypercubes and paths
From MaRDI portal
Cites work
- A local independence number condition for n-extendable graphs
- A polynomial algorithm for the extendability problem in bipartite graphs
- Binding number and toughness for matching extension
- Ear-decompositions of matching-covered graphs
- Extendability and criticality in matching theory
- Extendability of the complementary prism of extendable graphs
- Extending matchings in graphs: A survey
- scientific article; zbMATH DE number 637272 (Why is no real title available?)
- scientific article; zbMATH DE number 1161241 (Why is no real title available?)
- scientific article; zbMATH DE number 1471076 (Why is no real title available?)
- scientific article; zbMATH DE number 4118405 (Why is no real title available?)
- scientific article; zbMATH DE number 1405497 (Why is no real title available?)
- scientific article; zbMATH DE number 3232667 (Why is no real title available?)
- Independence number in n-extendable graphs
- Lexicographic product of extendable graphs
- Matching extendability in Cartesian products of cycles
- Matching Extendability in Hypercubes
- Matching theory
- N‐extendability of symmetric graphs
- On $r$-extendability of the hypercube $Q\sb n$
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- On n-extendable graphs
- On the matching extendability of graphs in surfaces
- On the structure of factorizable graphs
- Paths, flowers and vertex cover
- Paths, Trees, and Flowers
- Recent Progress in Matching Extension
- Spectral conditions for matching extension
- The Factorization of Linear Graphs
- The matching extension problem in general graphs is co-NP-complete
This page was built for publication: Matching extendability in Cartesian product of hypercubes and paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307339)
