DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
In order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable. And any planar graph that does not have 5-cycle adjacent to 6-cycle is DP-4...
| Κύριοι συγγραφείς: | , , |
|---|---|
| Μορφή: | Άρθρο |
| Γλώσσα: | English |
| Έκδοση: |
MDPI AG
2025-01-01
|
| Σειρά: | Mathematics |
| Θέματα: | |
| Διαθέσιμο Online: | https://www.mdpi.com/2227-7390/13/2/190 |