Pages that link to "Item:Q2306602"
From MaRDI portal
The following pages link to DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602):
Displaying 25 items.
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544) (← links)
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564) (← 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)
- Planar graphs without specific cycles are 2-degenerate (Q2037563) (← 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)
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles (Q2107762) (← links)
- Upper bound for DP-chromatic number of a graph (Q2143040) (← links)
- Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate (Q2144489) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
- Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Weak degeneracy of planar graphs without 4- and 6-cycles (Q6157423) (← links)
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
- Variable degeneracy of planar graphs without chorded 6-cycles (Q6652636) (← links)
