The following pages link to Zhidan Yan (Q345103):
Displaying 18 items.
- When does the list-coloring function of a graph equal its chromatic polynomial (Q345104) (← links)
- On the edge connectivity of direct products with dense graphs (Q367042) (← links)
- On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs (Q401157) (← links)
- Equitable colorings of Cartesian products with balanced complete multipartite graphs (Q476328) (← links)
- A weaker version of a conjecture on list vertex arboricity of graphs (Q497380) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 (Q514702) (← links)
- Connectivity of Kronecker products by \(K_2\) (Q659833) (← links)
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs (Q741756) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- Eigenvalues and chromatic number of a signed graph (Q2020660) (← links)
- The smallest pair of cospectral cubic graphs with different chromatic indexes (Q2065795) (← links)
- Disproof of a conjecture on the main spectrum of generalized Bethe trees (Q2074964) (← links)
- Connectivity of Kronecker products with complete multipartite graphs (Q2446351) (← links)
- (Q2936715) (← links)
- Equitable chromatic threshold of Kronecker products of complete graphs (Q4982928) (← links)
- Colorings versus list colorings of uniform hypergraphs (Q5066928) (← links)
- On the determinant of the \(Q\)-walk matrix of rooted product with a path (Q6629705) (← links)
