Yehong Shao

Electron. J. Graph Theory Appl., 2022

Asymptotically sharpening the $s$-Hamiltonian index bound.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

2021

Fine-Grained Tidal Flat Waterbody Extraction Method (FYOLOv3) for High-Resolution Remote Sensing Images.

[BibT_eX]

[DOI]

Remote. Sens., 2021

Real-Time Detection of River Surface Floating Object Based on Improved RefineDet.

[BibT_eX]

[DOI]

IEEE Access, 2021

2020

An Efficient Building Extraction Method from High Spatial Resolution Remote Sensing Images Based on Improved Mask R-CNN.

[BibT_eX]

[DOI]

Sensors, 2020

2018

Essential edge connectivity of line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Unsupervised Anomaly Detection Algorithm of Graph Data Based on Graph Kernel.

[BibT_eX]

[DOI]

Proceedings of the 4th IEEE International Conference on Cyber Security and Cloud Computing, 2017

2015

K-5-factor in a Graph.

[BibT_eX]

Ars Comb., 2015

2014

On strongly Z2s-1-connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

On s-Hamiltonian Line Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

2012

s-Vertex Pancyclic Index.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Spanning cycles in regular matroids without small cocircuits.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Degree condition and Z3-connectivity.

[BibT_eX]

[DOI]

Xiangwen Li

Discret. Math., 2012

Hamiltonian graphs involving neighborhood conditions.

[BibT_eX]

Ars Comb., 2012

2011

On 3-Edge-Connected Supereulerian Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Obstructions to a binary matroid being graphic.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

2010

Degree sum condition for Z3-connectivity in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

Connectivity of iterated line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Spanning eulerian subgraphs in N2-locally connected claw-free graphs.

[BibT_eX]

Ars Comb., 2010

2009

On mod (2p+1)-orientations of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2009

Every line graph of a 4-edge-connected graph is I-connected.

[BibT_eX]

[DOI]

Lianying Miao

Eur. J. Comb., 2009

Edge-connectivity and edge-disjoint spanning trees.

[BibT_eX]

[DOI]

Paul A. Catlin

Discret. Math., 2009

Hamiltonian connectedness in 3-connected line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Spanning cycles in regular matroids without M*(K5) minors.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

The s-Hamiltonian index.

[BibT_eX]

[DOI]

Discret. Math., 2008

Hamiltonian connected hourglass free line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.

[BibT_eX]

[DOI]

Discret. Math., 2008

On s-hamiltonian-connected line graphs.

[BibT_eX]

[DOI]

Yanting Liang

Discret. Math., 2008

Degree sequence and supereulerian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

New sufficient condition for Hamiltonian graphs.

[BibT_eX]

[DOI]

Kewen Zhao

Appl. Math. Lett., 2007

Hamiltonian Connected Line Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

Hamiltonicity in 3-connected claw-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2006

Every 3-connected, essentially 11-connected line graph is Hamiltonian.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2006

2005

Hamiltonian N2-locally connected claw-free graphs.

[BibT_eX]

[DOI]