scientific article
From MaRDI portal
Publication:3800093
zbMath0654.05066MaRDI QIDQ3800093
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items (28)
Equistarable bipartite graphs ⋮ A polynomial algorithm for the extendability problem in bipartite graphs ⋮ Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ Matching extension and minimum degree ⋮ Independence number in \(n\)-extendable graphs ⋮ Removable ears of 1-extendable graphs ⋮ Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ On the extendability of quasi-strongly regular graphs with diameter 2 ⋮ Equivalence classes in matching covered graphs ⋮ Hamiltonian and long paths in bipartite graphs with connectivity ⋮ Edge proximity conditions for extendability in regular bipartite graphs ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ \(M\)-alternating paths in \(n\)-extendable bipartite graphs ⋮ Matching extension and distance spectral radius ⋮ The extendability of Cayley graphs generated by transpositions ⋮ Face-width of Pfaffian braces and polyhex graphs on surfaces ⋮ The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) ⋮ On the matching extendability of graphs in surfaces ⋮ M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities ⋮ On the restricted matching extension of graphs in surfaces ⋮ Hamiltonian and long cycles in bipartite graphs with connectivity ⋮ Toughness and matching extension in graphs ⋮ On matching extensions with prescribed and proscribed edge sets. II ⋮ On the extendability of bi-Cayley graphs of finite abelian groups ⋮ On the structure of minimally \(n\)-extendable bipartite graphs ⋮ Matching theory and Barnette's conjecture ⋮ On extendability of Deza graphs with diameter 2 ⋮ Bipartite double cover and perfect 2-matching covered graph with its algorithm
This page was built for publication:
