Pages that link to "Item:Q2000565"
From MaRDI portal
The following pages link to Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565):
Displayed 17 items.
- 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)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- Cover and variable degeneracy (Q2075519) (← 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)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- (Q6072035) (← links)
- A sufficient condition for planar graphs to be <i>DP</i>-4-colorable (Q6075728) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)