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

DOI10.20429/tag.2021.080201zbMath1473.05091OpenAlexW3195108631MaRDI QIDQ3380402

Kenta Ozeki, Gina Malacas, Analen Malnegro

Publication date: 28 September 2021

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2021.080201

zbMATH Keywords

chromatic indexedge-chromatic number\(k\)-edge-coloring

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves