scientific article; zbMATH DE number 1161241
From MaRDI portal
Publication:4393233
Recommendations
Cited in
(36)- Minimum degree of minimal defect n-extendable bipartite graphs
- On matching extensions with prescribed and proscribed edge sets. II
- \(M\)-alternating paths in \(n\)-extendable bipartite graphs
- Connectivity of \(k\)-extendable graphs with large \(k\).
- The matching extension problem in general graphs is co-NP-complete
- Graphs with no \(M\)-alternating path between two vertices
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
- On the p-factor-criticality of the Klein bottle
- Minimum size of n-factor-critical graphs and k-extendable graphs
- The (\(n\), \(k\))-extendable graphs in surfaces
- Extendability and criticality in matching theory
- Toughness, binding number and restricted matching extension in a graph
- Edge proximity and matching extension in punctured planar triangulations
- Characterizing minimally \(n\)-extendable bipartite graphs
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs
- Edge Proximity Conditions for Extendability in Planar Triangulations
- Recent Progress in Matching Extension
- Asymmetric distance matching extension
- Matching extendability in Cartesian products of cycles
- Matching extension in prism graphs
- Generalization of matching extensions in graphs
- The maximum matching extendability and factor-criticality of 1-planar graphs
- Matching extension and distance spectral radius
- Removable and forced subgraphs of graphs
- On restricted matching extension of 1-embeddable graphs in surfaces with small genus
- Extending matchings in planar graphs. IV
- Distance-restricted matching extension in planar triangulations
- Graphs with no M-alternating paths between two vertices: an update
- On the restricted matching extension of graphs in surfaces
- Generalized matching extension problem in regular bipartite graphs
- Matching extendability in Cartesian product of hypercubes and paths
- Extending unlocked matchings in graphs
- A note on cyclic connectivity and matching properties of regular graphs
- A characterization of maximal non-\(k\)-factor-critical graphs
- Graph factors and factorization: 1985--2003: a survey
- Characterizing defect n-extendable bipartite graphs with different connectivities
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 Q4393233)
