The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves

Authors

Analen A. Malnegro, Mindanao State University - Iligan Institute of TechnologyFollow
Gina A. Malacas, Mindanao State University - Iligan Institute of TechnologyFollow
Kenta Ozeki, Yokohama National UniversityFollow

Abstract

The color number c(G) of a cubic graphG is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Malnegro, Analen A.; Malacas, Gina A.; and Ozeki, Kenta (2021) "The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves," Theory and Applications of Graphs: Vol. 8: Iss. 2, Article 1.
DOI: 10.20429/tag.2021.080201
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol8/iss2/1