Mingquan Zhan

Orcid: 0000-0002-0908-5165

According to our database1, Mingquan Zhan authored at least 33 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On hamiltonian properties of <i>K</i><sub>1,<i>r</i></sub>-free split graphs.
Discret. Math., July, 2023

Complete family reduction and spanning connectivity in line graphs.
Discret. Math., 2023

2022
On the extended Clark-Wormold Hamiltonian-like index problem.
Discret. Math., 2022

2021
On s-hamiltonicity of net-free line graphs.
Discret. Math., 2021

On the line graph of a graph with diameter 2.
Discret. Math., 2021

On (s, t)-supereulerian graphs with linear degree bounds.
Discret. Math., 2021

Polynomially determining spanning connectivity of locally connected line graphs.
Discret. Appl. Math., 2021

2020
Catlin's reduced graphs with small orders.
AKCE Int. J. Graphs Comb., 2020

Pancyclicity of 4-connected claw-free net-free graphs.
Australas. J Comb., 2020

2019
Pancyclicity of 4-Connected { K<sub>1, 3</sub>, Z<sub>8</sub>} -Free Graphs.
Graphs Comb., 2019

On s-hamiltonian line graphs of claw-free graphs.
Discret. Math., 2019

2018
Strongly Spanning Trailable Graphs with Short Longest Paths.
Ars Comb., 2018

2016
Full Cycle Extendability of Nearly Claw-Free Graphs.
Ars Comb., 2016

2015
Graphs with a 3-Cycle-2-Cover.
Graphs Comb., 2015

K<sup>-</sup><sub>5</sub>-factor in a Graph.
Ars Comb., 2015

2013
<i>Z</i><sub>3</sub>Z3-connectivity in Abelian Cayley graphs.
Discret. Math., 2013

2012
Spanning cycles in regular matroids without small cocircuits.
Eur. J. Comb., 2012

Z<sub>3</sub>-connectivity of 4-edge-connected 2-triangular graphs.
Eur. J. Comb., 2012

2011
On 3-Edge-Connected Supereulerian Graphs.
Graphs Comb., 2011

2010
Degree sum condition for Z<sub>3</sub>-connectivity in graphs.
Discret. Math., 2010

Hamiltonicity of 6-connected line graphs.
Discret. Appl. Math., 2010

Full cycle extendability of triangularly connected almost claw-free graphs.
Ars Comb., 2010

2009
Hamilton-connected indices of graphs.
Discret. Math., 2009

Hamiltonian connectedness in 3-connected line graphs.
Discret. Appl. Math., 2009

2008
Hamiltonian connected hourglass free line graphs.
Discret. Math., 2008

Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.
Discret. Math., 2008

2007
Vertex pancyclicity in quasi claw-free graphs.
Discret. Math., 2007

Hamiltonian Connected Line Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006
Hamiltonicity in 3-connected claw-free graphs.
J. Comb. Theory, Ser. B, 2006

2005
Hamiltonian <i>N</i><sub>2</sub>-locally connected claw-free graphs.
J. Graph Theory, 2005

Eulerian subgraphs and Hamilton-connected line graphs.
Discret. Appl. Math., 2005

Supereulerian planar graphs.
Ars Comb., 2005

2002
Neighborhood intersections and Hamiltonicity in almost claw-free graphs.
Discret. Math., 2002


  Loading...