Fan Wang

Graphs Comb., 2022

2019

One-to-one disjoint path covers in hypercubes with faulty edges.

[BibT_eX]

[DOI]

Weisheng Zhao

J. Supercomput., 2019

Hamiltonian paths passing through prescribed edges in balanced hypercubes.

[BibT_eX]

[DOI]

Huazhong Lü

Theor. Comput. Sci., 2019

Perfect matchings extend to two or more hamiltonian cycles in hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2019

Perfect Matching Covers of Cubic Graphs of Oddness 2.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

A type of perfect matchings extend to hamiltonian cycles in <i>k</i>-ary <i>n</i>-cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Construction for trees with unique minimum dominating sets.

[BibT_eX]

[DOI]

Weisheng Zhao

Int. J. Comput. Math. Comput. Syst. Theory, 2018

Matchings extend to Hamiltonian cycles in 5-cube.

[BibT_eX]

[DOI]

Weisheng Zhao

Discuss. Math. Graph Theory, 2018

Hamiltonian laceability in hypercubes with faulty edges.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Bondage number of the strong product of two trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Small Matchings Extend to Hamiltonian Cycles in Hypercubes.

[BibT_eX]

[DOI]

Graphs Comb., 2016

2015

Matchings extend to Hamiltonian cycles in k-ary n-cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2015

Two types of matchings extend to Hamiltonian cycles in hypercubes.

[BibT_eX]

Ars Comb., 2015

2014

Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges.

[BibT_eX]

[DOI]