Back to Search Start Over

Planar graphs having no cycle of length 4, 7, or 9 are DP‐3‐colorable.

Authors :
Kang, Yingli
Jin, Ligang
Zhu, Xuding
Source :
Journal of Graph Theory. May2024, p1. 15p. 2 Illustrations.
Publication Year :
2024

Abstract

This paper proves that every planar graph having no cycle of length 4, 7, or 9 is DP‐3‐colorable. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
03649024
Database :
Academic Search Index
Journal :
Journal of Graph Theory
Publication Type :
Academic Journal
Accession number :
177390267
Full Text :
https://doi.org/10.1002/jgt.23123