Zaker, M. (2025). O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with large girth. Discrete mathematics, 348(9), 114502. https://doi.org/10.1016/j.disc.2025.114502
Chicago Style (17th ed.) CitationZaker, Manouchehr. "O(VE) Time Algorithms for the Grundy (First-Fit) Chromatic Number of Block Graphs and Graphs with Large Girth." Discrete Mathematics 348, no. 9 (2025): 114502. https://doi.org/10.1016/j.disc.2025.114502.
MLA (9th ed.) CitationZaker, Manouchehr. "O(VE) Time Algorithms for the Grundy (First-Fit) Chromatic Number of Block Graphs and Graphs with Large Girth." Discrete Mathematics, vol. 348, no. 9, 2025, p. 114502, https://doi.org/10.1016/j.disc.2025.114502.
Warning: These citations may not always be 100% accurate.