Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges. - Fan Wang 007; Heping Zhang (Discret. Math., 2014)

Two types of matchings extend to Hamiltonian cycles in hypercubes. - Fan Wang 007; Heping Zhang (Ars Comb., 2015)

Matchings extend to Hamiltonian cycles in k-ary n-cubes. - Fan Wang 007; Heping Zhang (Inf. Sci., 2015)

Small Matchings Extend to Hamiltonian Cycles in Hypercubes. - Fan Wang 007; Heping Zhang (Graphs Comb., 2016)

Bondage number of the strong product of two trees. - Weisheng Zhao; Fan Wang 007; Xiaolu Gao; Hao Li 002 (Discret. Appl. Math., 2017)

Hamiltonian laceability in hypercubes with faulty edges. - Fan Wang 007; Heping Zhang (Discret. Appl. Math., 2018)

Matchings extend to Hamiltonian cycles in 5-cube. - Fan Wang 007; Weisheng Zhao (Discuss. Math. Graph Theory, 2018)

Construction for trees with unique minimum dominating sets. - Weisheng Zhao; Fan Wang 007; Heping Zhang (Int. J. Comput. Math. Comput. Syst. Theory, 2018)

A type of perfect matchings extend to hamiltonian cycles in k-ary n-cubes. - Fan Wang 007; Wuyang Sun (Theor. Comput. Sci., 2018)

Perfect Matching Covers of Cubic Graphs of Oddness 2. - Wuyang Sun; Fan Wang 007 (Electron. J. Comb., 2019)

Perfect matchings extend to two or more hamiltonian cycles in hypercubes. - Fan Wang 007; Wuyang Sun (Discret. Math., 2019)

Hamiltonian paths passing through prescribed edges in balanced hypercubes. - Huazhong Lü; Fan Wang 007 (Theor. Comput. Sci., 2019)

One-to-one disjoint path covers in hypercubes with faulty edges. - Fan Wang 007; Weisheng Zhao (J. Supercomput., 2019)

A Class of Cubic Graphs Satisfying Berge Conjecture. - Wuyang Sun; Fan Wang 007 (Graphs Comb., 2022)

Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges. - Fan Wang 007 (Discret. Appl. Math., 2025)