Graph Factors and Matching Extensions
From MaRDI portal
Publication:3613322
Recommendations
Cited in
(65)- On vertex-parity edge-colorings
- On bicriticality of (3,6)-fullerene graphs
- Minimum size of n-factor-critical graphs and k-extendable graphs
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- The (\(n\), \(k\))-extendable graphs in surfaces
- Hamiltonian and long cycles in bipartite graphs with connectivity
- A characterization for graphs having strong parity factors
- The existence of path-factor covered graphs
- Complete forcing numbers of hexagonal systems. II
- Extendability and criticality in matching theory
- Existence of all generalized fractional \((g, f)\)-factors of graphs
- Fractional factors, component factors and isolated vertex conditions in graphs
- A note on \(m\)-near-factor-critical graphs
- Approximating maximum uniquely restricted matchings in bipartite graphs
- Characterizations of graphs \(G\) having all \([1, k]\)-factors in \(k G\)
- On edge connectivity and parity factor
- On the bipartite graph packing problem
- \(P_3\)-factors in the square of a tree
- Hamiltonian and long paths in bipartite graphs with connectivity
- On Cui-Kano's characterization problem on graph factors
- Generalization of matching extensions in graphs. IV: Closures
- An extension of Cui-Kano's characterization on graph factors
- The extendability of matchings in strongly regular graphs
- Proximity thresholds for matching extension in the torus and Klein bottle
- On matching extendability of lexicographic products
- scientific article; zbMATH DE number 6863588 (Why is no real title available?)
- Surface embedding of \((n,k)\)-extendable graphs
- Asymmetric distance matching extension
- Matching extension in prism graphs
- Affine-invariant strictly cyclic Steiner quadruple systems
- Max-cut and extendability of matchings in distance-regular graphs
- On the permanental nullity and matching number of graphs
- Some results about component factors in graphs
- Extremal graphs with a given number of perfect matchings
- Factors and factorizations of graphs. Proof techniques in factor theory
- Surface Embedding of Non-Bipartite $k$-Extendable Graphs
- Perfect matchings in graphs with prescribed local restrictions
- \(P_k\)-factors in squares and line graphs of trees
- 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
- Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index
- Minimum degree of minimal (n-10)-factor-critical graphs
- Matching extension and matching exclusion via the size or the spectral radius of graphs
- Removable and forced subgraphs of graphs
- On restricted matching extension of 1-embeddable graphs in surfaces with small genus
- Tight toughness bounds for path-factor critical avoidable graphs
- On graph-based network parameters and component factors in networks
- Component factors and degree sum conditions in graphs
- Degree conditions for path-factors in graphs
- Degree sum conditions for path-factor uniform graphs
- Some results on the k-strong parity property in a graph
- Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
- The d-blocker number and d-transversal number of hexagonal systems
- Some sufficient conditions for a graph to be strong star factor
- Tight toughness, isolated toughness and binding number bounds for the \(\{K_2, C_n\}\)-factors
- Toughness, fractional extendability and distance spectral radius in graphs
- Nice vertices in cubic graphs
- Spectral radius and fractional \([a, b]\)-factor of graphs
- Sufficient conditions for the existence of path-factors with given properties
- 2-factors in graphs
- Eigenvalues and factors: a survey
- On the d-blocker number of k-ary n-cubes
- On affine-invariant two-fold quadruple systems
- Eigenvalues and \([1,n]\)-odd factors
This page was built for publication: Graph Factors and Matching Extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613322)
