Pages that link to "Item:Q1712501"
From MaRDI portal
The following pages link to Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501):
Displaying 17 items.
- 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)
- 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)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Relaxed DP-3-coloring of planar graphs without some cycles (Q2082416) (← links)
- Upper bound for DP-chromatic number of a graph (Q2143040) (← links)
- A deletion-contraction relation for the DP color function (Q2156187) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Variable degeneracy of planar graphs without chorded 6-cycles (Q6652636) (← links)
