The following pages link to Pongpat Sittitrai (Q1637125):
Displaying 15 items.
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544) (← links)
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles (Q2107762) (← links)
- A generalization of Grötzsch Theorem on the local-equitable coloring (Q2110276) (← links)
- Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate (Q2144489) (← links)
- Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
