z-logo
open-access-imgOpen Access
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
Author(s) -
Analen A. Malnegro,
Gina Malacas,
Kenta Ozeki
Publication year - 2021
Publication title -
theory and applications of graphs
Language(s) - English
Resource type - Journals
ISSN - 2470-9859
DOI - 10.20429/tag.2021.080201
Subject(s) - combinatorics , spanning tree , mathematics , cubic graph , bounded function , edge coloring , hamiltonian path , graph , discrete mathematics , graph power , line graph , voltage graph , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom