The following pages link to Runrun Liu (Q721919):
Displaying 19 items.
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← links)
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564) (← links)
- Spanning tree packing and 2-essential edge-connectivity (Q2092353) (← links)
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs (Q2192116) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
- Minimum degree condition for a graph to be knitted (Q2324511) (← links)
- A relaxation of the Bordeaux conjecture (Q2349972) (← links)
- Optimal connectivity for fat-triangle linkages (Q2689492) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- IC-planar graphs are odd-10-colorable (Q6160615) (← links)
