Pages that link to "Item:Q1618234"

The following pages link to DP-3-coloring of some planar graphs (Q1618234):

Displaying 21 items.

• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← 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)
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564) (← links)
• Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
• DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
• Answers to two questions on the DP color function (Q2030743) (← links)
• Planar graphs without specific cycles are 2-degenerate (Q2037563) (← links)
• Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
• DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← 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)
• 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)
• 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)
• Weak degeneracy of planar graphs without 4- and 6-cycles (Q6157423) (← links)
• A weak DP-coloring of planar graphs without 4- and 9-cycles (Q6184347) (← links)
• An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)