Pages that link to "Item:Q684119"
From MaRDI portal
The following pages link to Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119):
Displaying 50 items.
- The harmonic index of a graph and its DP-chromatic number (Q777446) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← 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)
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← 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)
- 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)
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Coloring squares of graphs with mad constraints (Q2009007) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- Answers to two questions on the DP color function (Q2030743) (← links)
- Differences between the list-coloring and DP-coloring for planar graphs (Q2032896) (← links)
- Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs (Q2037549) (← links)
- Planar graphs without specific cycles are 2-degenerate (Q2037563) (← 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)
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
- DP color functions versus chromatic polynomials (Q2070081) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Relaxed DP-3-coloring of planar graphs without some cycles (Q2082416) (← links)
- Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles (Q2084793) (← links)
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles (Q2107762) (← links)
- Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
- An extension of Thomassen's result on choosability (Q2139819) (← links)
- Upper bound for DP-chromatic number of a graph (Q2143040) (← links)
- Generalized signed graphs of large girth and large chromatic number (Q2144578) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- A deletion-contraction relation for the DP color function (Q2156187) (← links)
- The DP color function of joins and vertex-gluings of graphs (Q2166313) (← links)
- DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces (Q2170789) (← links)
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← 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)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- On-line DP-coloring of graphs (Q2197455) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- On 2-defective DP-colorings of sparse graphs (Q2225422) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Colouring of \(S\)-labelled planar graphs (Q2225437) (← links)
- Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
- Defective DP-colorings of sparse simple graphs (Q2237221) (← 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)
