The following pages link to Lingji Xu (Q393458):
Displaying 5 items.
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724) (← links)
- A sufficient condition for a plane graph with maximum degree 6 to be class 1 (Q1759890) (← links)
- Improper colorability of planar graphs with cycles of length neither 4 nor 6 (Q5017791) (← links)
- Improper Choosability of Planar Graphs without 4-Cycles (Q5408607) (← links)
