Zhongyuan Che

Orcid: 0000-0001-6125-2306

According to our database1, Zhongyuan Che authored at least 22 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Outerplane bipartite graphs with isomorphic resonance graphs.
Discret. Appl. Math., January, 2024

2023
(k+1)-line graphs of k-trees.
Australas. J Comb., October, 2023

Prediction using multi-objective slime mould algorithm optimized support vector regression model.
Appl. Soft Comput., September, 2023

Irregularities of maximal k-degenerate graphs.
Discret. Appl. Math., May, 2023

2022
k-Wiener index of a k-plex.
J. Comb. Optim., 2022

2021
Peripheral Convex Expansions of Resonance Graphs.
Order, 2021

Wiener Indices of Maximal k-Degenerate Graphs.
Graphs Comb., 2021

2020
Cube-free resonance graphs.
Discret. Appl. Math., 2020

2019
Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges.
Graphs Comb., 2019

An upper bound on Wiener Indices of maximal planar graphs.
Discret. Appl. Math., 2019

A characterization of the resonance graph of an outerplane bipartite graph.
Discret. Appl. Math., 2019

2018
Forcing and anti-forcing edges in bipartite graphs.
Discret. Appl. Math., 2018

Structural properties of resonance graphs of plane elementary bipartite graphs.
Discret. Appl. Math., 2018

2016
Minimum order of r-regular bipartite graphs of pair length k.
Australas. J Comb., 2016

2015
Sharp bounds on the size of pairable graphs and pairable bipartite graphs.
Australas. J Comb., 2015

2013
Forcing faces in plane bipartite graphs (II).
Discret. Appl. Math., 2013

The Distinguishing Chromatic Number of Kneser Graphs.
Electron. J. Comb., 2013

2010
On k-pairable regular graphs.
Discret. Math., 2010

2008
Odd-angulated graphs and cancelling factors in box products.
J. Graph Theory, 2008

Forcing faces in plane bipartite graphs.
Discret. Math., 2008

Uniquely pairable graphs.
Discret. Math., 2008

2007
Retracts of box products with odd-angulated factors.
J. Graph Theory, 2007


  Loading...