Pages that link to "Item:Q4581280"
From MaRDI portal
The following pages link to Sharp Dirac's theorem for DP‐critical graphs (Q4581280):
Displaying 24 items.
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- Sharpness of KKL on Schreier graphs (Q742981) (← links)
- On a question of Dirac on critical and vertex critical graphs (Q890907) (← links)
- Sharpness of some graph conditioned theorems on Borel 1 selectors (Q1068377) (← 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)
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564) (← 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)
- A deletion-contraction relation for the DP color function (Q2156187) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- Defective DP-colorings of sparse simple graphs (Q2237221) (← 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)
- Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)
- An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)
