Pages that link to "Item:Q1752670"
From MaRDI portal
The following pages link to A sufficient condition for DP-4-colorability (Q1752670):
Displaying 27 items.
- DP-3-coloring of some planar graphs (Q1618234) (← 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)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- Answers to two questions on the DP color function (Q2030743) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← 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 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← 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)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
- Coloring permutation-gain graphs (Q4986271) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- On colorings and orientations of signed graphs (Q6063839) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)
