The following pages link to Qinglin Roger Yu (Q189766):
Displaying 50 items.
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- A characterization of graphs with equal domination number and vertex cover number (Q432542) (← links)
- Generalization of matching extensions in graphs. III (Q534332) (← links)
- New improvements on connectivity of cages (Q546369) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- General fractional \(f\)-factor numbers of graphs (Q617025) (← links)
- Vertex-coloring edge-weightings of graphs (Q647275) (← links)
- A note on cyclic connectivity and matching properties of regular graphs (Q742609) (← links)
- Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties (Q763635) (← links)
- On chromatic and flow polynomial unique graphs (Q947115) (← links)
- Component factors with large components in graphs (Q963816) (← links)
- Lexicographic product of extendable graphs (Q974316) (← links)
- A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs (Q989762) (← links)
- Constructive proof of deficiency theorem of \((g,f)\)-factor (Q989802) (← links)
- A note on graph minors and strong products (Q990784) (← links)
- On vertex-coloring 13-edge-weighting (Q1001315) (← links)
- On Tutte polynomial uniqueness of twisted wheels (Q1011729) (← links)
- Factor-critical property in 3-dominating-critical graphs (Q1011779) (← links)
- Vertex arboricity of integer distance graph \(G(D_{m,k})\) (Q1024482) (← links)
- Classifying 2-extendable generalized Petersen graphs (Q1197056) (← links)
- A note on extendability and factor-criticality (Q1400798) (← links)
- Connectivity of \(k\)-extendable graphs with large \(k\). (Q1421484) (← links)
- SICR rumor spreading model in complex networks: counterattack and self-resistance (Q1782812) (← links)
- On barrier sets of star-factors (Q1813717) (← links)
- On 2-extendable abelian Cayley graphs (Q1903715) (← links)
- On Cartesian product of factor-critical graphs (Q1926021) (← links)
- On superconnectivity of (\(4, g\))-cages (Q1938884) (← links)
- Star-uniform graphs (Q1959711) (← links)
- Critical independent sets of König-Egerváry graphs (Q2146733) (← links)
- Fractional factors, component factors and isolated vertex conditions in graphs (Q2278109) (← links)
- Characterizations of graphs \(G\) having all \([1, k]\)-factors in \(k G\) (Q2329169) (← links)
- Generalization of matching extensions in graphs. II. (Q2370426) (← links)
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs (Q2424828) (← links)
- Maximum fractional factors in graphs (Q2472791) (← links)
- Tree coloring of distance graphs with a real interval set (Q2481438) (← links)
- Pan-factorial property in regular graphs (Q2583675) (← links)
- An alternative proof of general factor structure theorem (Q2694958) (← links)
- Toughness and perfect matchings in graphs (Q2715945) (← links)
- Edge disjoint Hamilton cycles in intersection graphs of bases of matroids (Q2848810) (← links)
- Strong product of factor-critical graphs (Q2885500) (← links)
- Uniformly Weighted Star-Factors of Graphs (Q2936728) (← links)
- On superconnectivity of (4,<i>g</i>)-cages with even girth (Q3057176) (← links)
- (Q3070291) (← links)
- Matching and Factor-Critical Property in 3-Dominating-Critical Graphs (Q3105536) (← links)
- (Q3108609) (← links)
- (Q3118108) (← links)
- (Q3139763) (← links)
- On (n,k)-extendable graphs and induced subgraphs (Q3518860) (← links)
- (Q3534281) (← links)
- (Q3568732) (← links)
