Pages that link to "Item:Q5379843"
From MaRDI portal
The following pages link to A note on a Brooks' type theorem for DP‐coloring (Q5379843):
Displaying 23 items.
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- Group colorability of multigraphs (Q1759814) (← 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)
- Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions (Q2053689) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- A deletion-contraction relation for the DP color function (Q2156187) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← 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)
- DP-degree colorable hypergraphs (Q2333798) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Brooks-type theorem for \(r\)-hued coloring of graphs (Q2696623) (← links)
- Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- The Johansson‐Molloy theorem for DP‐coloring (Q5229335) (← links)
- DP‐coloring Cartesian products of graphs (Q6074580) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)
