Graph Factors and Matching Extensions
From MaRDI portal
Publication:3613322
DOI10.1007/978-3-540-93952-8zbMath1232.05001OpenAlexW369866893MaRDI QIDQ3613322
Publication date: 12 March 2009
Full work available at URL: https://doi.org/10.1007/978-3-540-93952-8
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (44)
Complete forcing numbers of hexagonal systems. II ⋮ An Extension of Cui-Kano's Characterization on Graph Factors ⋮ Generalization of matching extensions in graphs. IV: Closures ⋮ \(P_3\)-factors in the square of a tree ⋮ Extremal Graphs With a Given Number of Perfect Matchings ⋮ Extendability and criticality in matching theory ⋮ Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ Unnamed Item ⋮ Hamiltonian and long paths in bipartite graphs with connectivity ⋮ The extendability of matchings in strongly regular graphs ⋮ \(P_k\)-factors in squares and line graphs of trees ⋮ Existence of all generalized fractional \((g, f)\)-factors of graphs ⋮ Binding number and path-factor critical deleted graphs ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ On affine-invariant two-fold quadruple systems ⋮ Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index ⋮ Proximity thresholds for matching extension in the torus and Klein bottle ⋮ Minimum degree of minimal \((n-10)\)-factor-critical graphs ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ On matching extendability of lexicographic products ⋮ On vertex-parity edge-colorings ⋮ Unnamed Item ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ On bicriticality of (3,6)-fullerene graphs ⋮ Matching extension in prism graphs ⋮ Affine-invariant strictly cyclic Steiner quadruple systems ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ Perfect matchings and \(K_{1,p}\)-restricted graphs ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ Eigenvalues and \([1,n\)-odd factors] ⋮ Fractional factors, component factors and isolated vertex conditions in graphs ⋮ Hamiltonian and long cycles in bipartite graphs with connectivity ⋮ On the permanental nullity and matching number of graphs ⋮ A characterization for graphs having strong parity factors ⋮ A note on \(m\)-near-factor-critical graphs ⋮ Approximating maximum uniquely restricted matchings in bipartite graphs ⋮ Some results about component factors in graphs ⋮ Characterizations of graphs \(G\) having all \([1, k\)-factors in \(k G\)] ⋮ On Cui-Kano's Characterization Problem on Graph Factors ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs ⋮ The existence of path-factor covered graphs ⋮ On edge connectivity and parity factor ⋮ On the bipartite graph packing problem
This page was built for publication: Graph Factors and Matching Extensions
