Ruixia Wang

Discuss. Math. Graph Theory, 2024

Quantum Compiling with Reinforcement Learning on a Superconducting Processor.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Structured deep learning based object-specific distance estimation from a monocular image.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., December, 2023

Multi-state feature optimization of sign glosses for continuous sign language recognition.

[BibT_eX]

[DOI]

J. Intell. Fuzzy Syst., October, 2023

A Sufficient Condition for Vertex Bipancyclicity in Balanced Bipartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., August, 2023

Degree sum condition on distance 2 vertices for hamiltonian cycles in balanced bipartite graphs.

[BibT_eX]

[DOI]

Zhiyi Zhou

Discret. Math., July, 2023

2022

A Note on Dominating Pair Degree Condition for Hamiltonian Cycles in Balanced Bipartite Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2022

2021

Extremal digraphs on Woodall-type condition for Hamiltonian cycles in balanced bipartite digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

2020

A dominated pair condition for a digraph to be hamiltonian.

[BibT_eX]

[DOI]

Jingfang Chang

Discret. Math., 2020

A dominating pair condition for a balanced bipartite digraph to be hamiltonian.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

2019

Critical Kernel Imperfect Problem in Generalizations of Bipartite Tournaments.

[BibT_eX]

[DOI]

Graphs Comb., 2019

2017

A sufficient condition for a balanced bipartite digraph to be hamiltonian.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2017

The signed cycle domatic number of a graph.

[BibT_eX]

Ars Comb., 2017

A note on cycles of maximum length in bipartite digraphs.

[BibT_eX]

[DOI]

Jing Guo

Australas. J Comb., 2017

2016

Hamiltonian paths in k-quasi-transitive digraphs.

[BibT_eX]

[DOI]

Hui Zhang

Discret. Math., 2016

Kings in strong tournaments.

[BibT_eX]

Ars Comb., 2016

2015

k-Kings in k-Quasitransitive Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

(k-1)-kernels in strong k-transitive digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

(k+1)-kernels and the number of k-kings in k-quasi-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Sharp lower bounds on signed domination numbers of digraphs.

[BibT_eX]

Ars Comb., 2015

2014

A conjecture on 3-anti-quasi-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

Cycles in 3-anti-circulant digraphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

2013

Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

A sufficient condition for graphs to be λk-optimal.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

A conjecture on k-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube.

[BibT_eX]

[DOI]

Jing Li

Inf. Sci., 2011

Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

Kings in locally semicomplete digraphs.

[BibT_eX]

[DOI]

Aimin Yang

J. Graph Theory, 2010

Matching preclusion for k-ary n-cubes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

The structure of strong arc-locally in-semicomplete digraphs.

[BibT_eX]

[DOI]