scientific article; zbMATH DE number 1161241
From MaRDI portal
Publication:4393233
zbMath0902.05059MaRDI QIDQ4393233
Publication date: 28 September 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ On the \(p\)-factor-criticality of the Klein bottle ⋮ A characterization of maximal non-\(k\)-factor-critical graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Toughness, binding number and restricted matching extension in a graph ⋮ Edge proximity and matching extension in punctured planar triangulations ⋮ Extendability and criticality in matching theory ⋮ Characterizing defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ Edge Proximity Conditions for Extendability in Planar Triangulations ⋮ Unnamed Item ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ \(M\)-alternating paths in \(n\)-extendable bipartite graphs ⋮ Matching extension and distance spectral radius ⋮ Connectivity of \(k\)-extendable graphs with large \(k\). ⋮ Matching extension in prism graphs ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ Characterizing minimally \(n\)-extendable bipartite graphs ⋮ Unnamed Item ⋮ 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 ⋮ Construction for bicritical graphs and \(k\)-extendable bipartite graphs ⋮ A note on cyclic connectivity and matching properties of regular graphs ⋮ Graphs with no \(M\)-alternating path between two vertices ⋮ On matching extensions with prescribed and proscribed edge sets. II ⋮ Minimum degree of minimal defect \(n\)-extendable bipartite graphs
This page was built for publication:
