The following pages link to On n-extendable graphs (Q1143417):
Displayed 50 items.
- Equistarable bipartite graphs (Q279223) (← links)
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- On the restricted matching extension of graphs on the torus and the Klein bottle (Q442346) (← links)
- Kauffman's clock lattice as a graph of perfect matchings: a formula for its height (Q470959) (← links)
- Surface embedding of \((n,k)\)-extendable graphs (Q477346) (← links)
- Face-width of Pfaffian braces and polyhex graphs on surfaces (Q490246) (← links)
- Matching extension in prism graphs (Q512532) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities (Q534043) (← links)
- Generalization of matching extensions in graphs. III (Q534332) (← links)
- 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes (Q534343) (← links)
- Removable ears of 1-extendable graphs (Q601904) (← links)
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes (Q608264) (← links)
- The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) (Q668067) (← links)
- A new recursive theorem on \(n\)-extendibility (Q675894) (← links)
- Extending matchings in planar graphs. IV (Q686303) (← links)
- Graphs with no \(M\)-alternating paths between two vertices: an update (Q712278) (← links)
- On the restricted matching extension of graphs in surfaces (Q712598) (← links)
- On 2-extendable quasi-abelian Cayley graphs (Q726500) (← links)
- 4-factor-criticality of vertex-transitive graphs (Q726659) (← links)
- A note on cyclic connectivity and matching properties of regular graphs (Q742609) (← links)
- On the 2-extendability of the generalized Petersen graphs (Q757430) (← links)
- A characterization of maximal non-\(k\)-factor-critical graphs (Q861799) (← links)
- Characterizing defect \(n\)-extendable bipartite graphs with different connectivities (Q882112) (← links)
- The matching extendability of surfaces (Q918993) (← links)
- A lower bound on the number of removable ears of 1-extendable graphs (Q966053) (← links)
- Bipartite matching extendable graphs (Q998414) (← links)
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes (Q1003671) (← links)
- M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles (Q1025964) (← links)
- Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs (Q1032542) (← links)
- Bounding the size of equimatchable graphs of fixed genus (Q1043800) (← links)
- Minimum degree of minimal defect \(n\)-extendable bipartite graphs (Q1045020) (← links)
- On the extendability of bi-Cayley graphs of finite abelian groups (Q1045084) (← links)
- Ear-decompositions of matching-covered graphs (Q1052341) (← links)
- Extending subpermutation matrices in regular classes of matrices (Q1077419) (← links)
- Matching extension and the genus of a graph (Q1107545) (← links)
- Extending partial systems of distinct representatives (Q1179087) (← links)
- On the 2-extendability of planar graphs (Q1186375) (← links)
- The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable (Q1197017) (← links)
- Classifying 2-extendable generalized Petersen graphs (Q1197056) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs (Q1210558) (← links)
- On matching extensions with prescribed and proscribed edge sets. II (Q1292810) (← links)
- A local independence number condition for \(n\)-extendable graphs (Q1296992) (← links)
- On the structure of minimally \(n\)-extendable bipartite graphs (Q1301712) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- Extending matchings in claw-free graphs (Q1322284) (← links)