The following pages link to Jian-Sheng Cai (Q477485):
Displaying 50 items.
- (Q277656) (redirect page) (← links)
- (Q1934389) (redirect page) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← links)
- A note on the existence of fractional \(f\)-factors in random graphs (Q477487) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494) (← links)
- The stability number and connected \([k,k+1]\)-factor in graphs (Q1023082) (← links)
- Degree and stability number condition for the existence of connected factors in graphs (Q1032554) (← links)
- Improved upper bound for generalized acyclic chromatic number of graphs (Q1617036) (← links)
- The classification of \(f\)-coloring of graphs with large maximum degree (Q1740035) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← links)
- An upper bound for the choice number of star edge coloring of graphs (Q2008856) (← links)
- List injective coloring of planar graphs (Q2155650) (← links)
- Acyclic coloring of claw-free graphs with small degree (Q2172408) (← links)
- Neighbor sum distinguishing index of sparse graphs (Q2194737) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles (Q2376098) (← links)
- Improved upper bound for the degenerate and star chromatic numbers of graphs (Q2410096) (← links)
- \(f\)-class two graphs whose \(f\)-cores have maximum degree two (Q2452406) (← links)
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable (Q2453854) (← links)
- Binding number and Hamiltonian \((g,f)\)-factors in graphs (Q2471346) (← links)
- (Q2839678) (← links)
- (Q2839736) (← links)
- (Q2839747) (← links)
- (Q2859806) (← links)
- (Q2859863) (← links)
- (Q2870965) (← links)
- (Q2895387) (← links)
- (Q2924368) (← links)
- (Q2992094) (← links)
- (Q3011817) (← links)
- (Q3070357) (← links)
- (Q3115075) (← links)
- (Q3166445) (← links)
- (Q3428672) (← links)
- Binding number and Hamiltonian (<i>g, f</i>)-factors in graphs II (Q3526044) (← links)
- (Q3545990) (← links)
- 随机图的$f$-染色的分类 II (Q5037963) (← links)
- (Q5037979) (← links)
- List injective coloring of planar graphs with disjoint 5−-cycles (Q5083875) (← links)
- (Q5173722) (← links)
- (Q5196117) (← links)
- (Q5206433) (← links)
- (Q5209828) (← links)
- (Q5367618) (← links)
- (Q5368535) (← links)
- Some results about <i>f</i>‐critical graphs (Q5434587) (← links)
