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):
Displayed 14 items.
- 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)
- 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 \(\{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)
- A sufficient condition for planar graphs to be <i>DP</i>-4-colorable (Q6075728) (← 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)