Yan Cao

Orcid: 0000-0002-9093-6034

Affiliations:
  • Dalian University of Technology, School of Mathematical Sciences, Liaoning, China


According to our database1, Yan Cao authored at least 19 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Overfullness of edge-critical graphs with small minimal core degree.
J. Graph Theory, 2024

The core conjecture of Hilton and Zhao.
J. Comb. Theory B, 2024

Precoloring extension of Vizing's Theorem for multigraphs.
Eur. J. Comb., 2024

2023
Decomposition of class II graphs into two class I graphs.
Discret. Math., December, 2023

On Gupta's Codensity Conjecture.
SIAM J. Discret. Math., September, 2023

The average degree of edge chromatic critical graphs with maximum degree seven.
J. Graph Theory, July, 2023

Double Vizing fans in critical class two graphs.
J. Graph Theory, May, 2023

Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications.
Discret. Appl. Math., April, 2023

2022
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree.
SIAM J. Discret. Math., September, 2022

Independence number of edge-chromatic critical graphs.
J. Graph Theory, 2022

A note on Goldberg's conjecture on total chromatic numbers.
J. Graph Theory, 2022

Overfullness of critical class 2 graphs with a small core degree.
J. Comb. Theory B, 2022

An improvement to the Hilton-Zhao vertex-splitting conjecture.
Discret. Math., 2022

2021
On the average degree of edge chromatic critical graphs.
J. Comb. Theory B, 2021

2020
Ring graphs and Goldberg's bound on chromatic index.
J. Graph Theory, 2020

On the average degree of edge chromatic critical graphs II.
J. Comb. Theory B, 2020

Hamiltonicity of edge-chromatic critical graphs.
Discret. Math., 2020

2019
Graph Edge Coloring: A Survey.
Graphs Comb., 2019

Average degrees of edge-chromatic critical graphs.
Discret. Math., 2019


  Loading...