The color number of cubic graphs having a spanning tree with a bounded number of leaves

DOI10.20429/TAG.2021.080201MaRDI QIDQ3380402zbMATH OpenOpenAlexFDO

Authors Analen Malnegro, Gina Malacas, Kenta Ozeki

Publication date 28 September 2021

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

Copyright license Creative Commons Attribution 4.0 International

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) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the minimum leaf number of cubic graphs
• Color-character of uncolorable cubic graphs
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• On 4-edge coloring of cubic graphs containing ``small non-planar subgraphs
• The b-chromatic number of cubic graphs

Cited in

(1)

• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)

This page was built for publication: The color number of cubic graphs having a spanning tree with a bounded number of leaves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3380402)