Pages that link to "Item:Q2000564"
From MaRDI portal
The following pages link to DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564):
Displaying 19 items.
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- Differences between the list-coloring and DP-coloring for planar graphs (Q2032896) (← 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)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
- On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles (Q2859766) (← links)
- Weak degeneracy of planar graphs without 4- and 6-cycles (Q6157423) (← links)
- A weak DP-coloring of planar graphs without 4- and 9-cycles (Q6184347) (← links)
- Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable (Q6606324) (← links)