Yuanqiu Huang

Licheng Zhang

Appl. Math. Comput., November, 2023

The generalized 3-connectivity of burnt pancake graphs and godan graphs.

[BibT_eX]

[DOI]

Zuozheng Zhang

AKCE Int. J. Graphs Comb., January, 2023

2022

On the Size of Matchings in 1-Planar Graph with High Minimum Degree.

[BibT_eX]

[DOI]

Fengming Dong

SIAM J. Discret. Math., December, 2022

The crossing number of hexagonal graph H3, n in the projective plane.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

New upper bounds for the crossing numbers of crossing-critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

Zip product of graphs and crossing numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

The Maximal 1-Planarity and Crossing Numbers of Graphs.

[BibT_eX]

[DOI]

Fengming Dong

Graphs Comb., 2021

A Note on the Crossing Number of the Cone of a Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2021

The crossing number of Cartesian product of 5-wheels with any tree.

[BibT_eX]

[DOI]

Yuxi Wang

Discuss. Math. Graph Theory, 2021

On the Sizes of Bipartite 1-Planar Graphs.

[BibT_eX]

[DOI]

Fengming Dong

Electron. J. Comb., 2021

2020

The crossing number of K5, n+1∖e.

[BibT_eX]

[DOI]

Yuxi Wang

Appl. Math. Comput., 2020

Graphs whose crossing numbers are the same as those of their line graphs.

[BibT_eX]

[DOI]

Tinglei Zhao

Australas. J Comb., 2020

2019

The crossing number of the hexagonal graph H3, n.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

2018

The crossing number of join of the generalized Petersen graph P(3, 1) with path and cycle.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

The crossing numbers of join of some graphs with n isolated vertices.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

The Strong Product of Graphs and Crossing Numbers.

[BibT_eX]

Ars Comb., 2018

The crossing numbers of Cartesian products of path with some graphs.

[BibT_eX]

Ars Comb., 2018

2017

On the Crossing Numbers of the Joint Graphs of a Path or a Cycle.

[BibT_eX]

Zhidong Zhou

Ars Comb., 2017

2016

Total Embedding distributions for two graph families obtained from the dipole D3.

[BibT_eX]

Ting Guo

Ars Comb., 2016

2014

The crossing number of the Cartesian product of paths with complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

2013

On the Crossing Number of the Cartesian Product of a 6-Vertex Graph with Sn.

[BibT_eX]

Lixi Zhang

Ars Comb., 2013

The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability.

[BibT_eX]

Ars Comb., 2013

Lower bound on the number of the maximum genus embedding of Kn, n.

[BibT_eX]

Ars Comb., 2013

2012

Vertex Splitting and Upper Embeddable Graphs

[BibT_eX]

[DOI]

CoRR, 2012

2011

On the Crossing Number of the Generalized Petersen Graph P(3k, k).

[BibT_eX]

Zihan Yuan

Ars Comb., 2011

2010

On the lower bounds for the maximum genus for simple graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

2009

Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices.

[BibT_eX]

[DOI]

Graphs Comb., 2009

2008

The Crossing Number of C (8, 2) P n .

[BibT_eX]

[DOI]

Graphs Comb., 2008

The crossing number of K1, 4, n.

[BibT_eX]

[DOI]

Tinglei Zhao

Discret. Math., 2008

2007

The Crossing Number of Cartesian Products of Complete Bipartite Graphs K 2, m with Paths P n .

[BibT_eX]

[DOI]

Ling Tang

Shengxiang Lv

Graphs Comb., 2007

A note on the computational complexity of graph vertex partition.

[BibT_eX]

[DOI]

Yuming Chu

Discret. Appl. Math., 2007

2005

Maximum genus, connectivity and minimal degree of graphs.

[BibT_eX]

[DOI]

Tinglei Zhao

Discret. Math., 2005

2003

Maximum genus of a graph in terms of its embedding properties.

[BibT_eX]

[DOI]

Discret. Math., 2003

Maximum genus and chromatic number of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

2000

Face Size and the Maximum Genus of a Graph 1. Simple Graphs.

[BibT_eX]

[DOI]

Yanpei Liu

J. Comb. Theory, Ser. B, 2000

1999

The maximum genus of graphs with diameter three.

[BibT_eX]

[DOI]