The following pages link to Wenjie He (Q210381):
Displaying 32 items.
- (Q588720) (redirect page) (← links)
- A note on path kernels and partitions (Q710611) (← links)
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs (Q932663) (← links)
- Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← links)
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) (Q998482) (← links)
- On Hamiltonian colorings for some graphs (Q1005245) (← links)
- Ohba's conjecture is true for graphs with independence number at most three (Q1023085) (← links)
- Algebraic expressions for Kekulé structure counts of nonbranched cata- condensed benzenoid (Q1183330) (← links)
- Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
- Cut invariant \(d\) and bond orders of Kekuléan benzenoids (Q1917332) (← links)
- The edge span of T-coloring on graph \(C^{d}_{n}\) (Q2371031) (← links)
- On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)
- On \(T\)-set of \(T\)-colorings (Q2581436) (← links)
- (Q3011804) (← links)
- (Q3070332) (← links)
- Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs (Q3595438) (← links)
- (Q3801603) (← links)
- (Q4036018) (← links)
- (Q4036019) (← links)
- (Q4294595) (← links)
- (Q4321960) (← links)
- (Q4653443) (← links)
- Edge-partitions of planar graphs and their game coloring numbers (Q4798121) (← links)
- (Q4858134) (← links)
- (Q4858135) (← links)
- Improved upper bounds for nearly antipodal chromatic number of paths (Q5444065) (← links)
- (Q5452942) (← links)
- (Q5475530) (← links)
- (Q5480716) (← links)
- (Q5487918) (← links)
- The use of Euler's formula in (3,1)*-list-coloring (Q5492689) (← links)
- The integral sum number of complete bipartite graphs \(K_{r,s}\) (Q5946754) (← links)