1 citations · 1 across the 5 of their papers we have counts for
5 papers
The average degree of edge chromatic critical graphs with maximum degree seven
Yan Cao, Rong Luo, Zhengke Miao +1
In this paper, by developing several new adjacency lemmas about a path on or vertices, we show that the average degree of 7-critical graphs is at least 6. It implies Vizing…
Decomposition of class II graphs into two class I graphs
Yan Cao, Guangming Jing, Rong Luo +3
Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum -edge-colorable subgraph and a matching.…
Chudnovsky's formula for revisited
Yue Zhao
The document contains an outline of a modular proof for Ramanujan-Chudnovsky identity.
Enumeration on row-increasing tableaux of shape
Rosena R. X. Du, Xiaojie Fan, Yue Zhao
Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape , and obtained a polynomial on the major index of these tableaux, which is a -analogue…
Hamiltonicity of edge-chromatic critical graphs
Yan Cao, Guantao Chen, Suyun Jiang +2
Given a graph , denote by and the maximum degree and the chromatic index of , respectively. A simple graph is called {\it edge--critical} if $χ^\prime(G…