Pages that link to "Item:Q3613322"
From MaRDI portal
The following pages link to Graph Factors and Matching Extensions (Q3613322):
Displayed 44 items.
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- Proximity thresholds for matching extension in the torus and Klein bottle (Q423899) (← links)
- Surface embedding of \((n,k)\)-extendable graphs (Q477346) (← links)
- Matching extension in prism graphs (Q512532) (← links)
- Affine-invariant strictly cyclic Steiner quadruple systems (Q517265) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- On affine-invariant two-fold quadruple systems (Q897251) (← links)
- Eigenvalues and \([1,n]\)-odd factors (Q979009) (← links)
- On vertex-parity edge-colorings (Q1702821) (← links)
- On bicriticality of (3,6)-fullerene graphs (Q1734896) (← links)
- Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs (Q1926044) (← links)
- Perfect matchings and \(K_{1,p}\)-restricted graphs (Q1996835) (← links)
- The (\(n\), \(k\))-extendable graphs in surfaces (Q2000587) (← links)
- Hamiltonian and long cycles in bipartite graphs with connectivity (Q2032971) (← links)
- A characterization for graphs having strong parity factors (Q2045389) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- Complete forcing numbers of hexagonal systems. II (Q2143442) (← links)
- Extendability and criticality in matching theory (Q2175791) (← links)
- Existence of all generalized fractional \((g, f)\)-factors of graphs (Q2192082) (← links)
- Fractional factors, component factors and isolated vertex conditions in graphs (Q2278109) (← links)
- A note on \(m\)-near-factor-critical graphs (Q2311372) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- Characterizations of graphs \(G\) having all \([1, k]\)-factors in \(k G\) (Q2329169) (← links)
- On edge connectivity and parity factor (Q2353240) (← links)
- On the bipartite graph packing problem (Q2357142) (← links)
- \(P_3\)-factors in the square of a tree (Q2657058) (← links)
- Hamiltonian and long paths in bipartite graphs with connectivity (Q2675844) (← links)
- On Cui-Kano's Characterization Problem on Graph Factors (Q2862548) (← links)
- An Extension of Cui-Kano's Characterization on Graph Factors (Q3466349) (← links)
- On matching extendability of lexicographic products (Q4603945) (← links)
- (Q4990102) (← links)
- On the permanental nullity and matching number of graphs (Q5206292) (← links)
- Some results about component factors in graphs (Q5242258) (← links)
- Extremal Graphs With a Given Number of Perfect Matchings (Q5325953) (← links)
- Surface Embedding of Non-Bipartite $k$-Extendable Graphs (Q5865906) (← links)
- (Q6081758) (← links)
- \(P_k\)-factors in squares and line graphs of trees (Q6096380) (← links)
- Binding number and path-factor critical deleted graphs (Q6101463) (← links)
- The maximum matching extendability and factor-criticality of 1-planar graphs (Q6110614) (← links)
- Minimally \(k\)-factor-critical graphs for some large \(k\) (Q6115428) (← links)
- Complete characterization of path-factor and path-factor covered graphs via <i>Q</i> -index and <i>D</i> -index (Q6177673) (← links)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs (Q6197704) (← links)
- Matching extension and matching exclusion via the size or the spectral radius of graphs (Q6202947) (← links)