Pages that link to "Item:Q2629278"
From MaRDI portal
The following pages link to The asymptotic behavior of the correspondence chromatic number (Q2629278):
Displayed 32 items.
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- 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)
- A note on the DP-chromatic number of complete bipartite graphs (Q1783631) (← 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)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Answers to two questions on the DP color function (Q2030743) (← links)
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← 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)
- 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)
- The local cut lemma (Q2357223) (← links)
- On DP-coloring of graphs and multigraphs (Q2360256) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
- Relation between the correspondence chromatic number and the Alon-Tarsi number (Q2699913) (← links)
- Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
- The $\chi$-Ramsey Problem for Triangle-Free Graphs (Q5074951) (← links)
- Weak degeneracy of graphs (Q6047953) (← links)
- Single‐conflict colouring (Q6055933) (← links)
- (Q6072035) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Separating the online and offline DP-chromatic numbers (Q6117242) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Packing list‐colorings (Q6185050) (← links)