The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable

Documenti analoghi

• The square of a subcubic planar graph without a 5-cycle is 7-choosable
  di: Kim, Seog-Jin, et al.
  Pubblicazione: (2025)
• Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
  di: Kim, Seog-Jin, et al.
  Pubblicazione: (2025)
• Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
  di: Jin, Ligang, et al.
  Pubblicazione: (2024)
• Degree-truncated choosability of planar graphs
  di: Jiang, Yiting, et al.
  Pubblicazione: (2024)
• Minimum saturated graphs without $4$-cycles and $5$-cycles
  di: Ma, Yue
  Pubblicazione: (2025)