Pages that link to "Item:Q2400975"
From MaRDI portal
The following pages link to DP-colorings of graphs with high chromatic number (Q2400975):
Displayed 21 items.
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- 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)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Answers to two questions on the DP color function (Q2030743) (← links)
- DP color functions versus chromatic polynomials (Q2070081) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- The DP color function of joins and vertex-gluings of graphs (Q2166313) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- A refinement of choosability of graphs (Q2284741) (← 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-degree colorable hypergraphs (Q2333798) (← 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)
- ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ (Q6047969) (← links)
- (Q6072035) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)