Pages that link to "Item:Q1988544"
From MaRDI portal
The following pages link to Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544):
Displaying 14 items.
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← links)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Relaxed DP-3-coloring of planar graphs without some cycles (Q2082416) (← links)
- Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles (Q2084793) (← links)
- Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate (Q2144489) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)
- Variable degeneracy of planar graphs without chorded 6-cycles (Q6652636) (← links)
