On the minimum leaf number of cubic graphs

DOI10.1016/j.disc.2019.06.005zbMath1419.05045arXiv1806.04451OpenAlexW2963661095WikidataQ127576600 ScholiaQ127576600MaRDI QIDQ2324488

Kenta Ozeki, Jan Goedgebeur, Gábor Wiener, Nicolas Van Cleemput

Publication date: 11 September 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.04451

zbMATH Keywords

spanning treecubicminimum leaf numbernon-traceable

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Connectivity (05C40)

Related Items

Scatter search for the minimum leaf spanning tree problem ⋮ Induced path factors of regular graphs ⋮ A note on connected domination number and leaf number

Uses Software

• nauty
• Traces
• snarkhunter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On non-traceable, non-hypotraceable, arachnoid graphs
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• The smallest 2-connected cubic bipartite planar nonhamiltonian graph
• The smallest cubic multigraphs with prescribed bipartite, block, Hamiltonian and planar properties
• On finding spanning trees with few leaves
• Practical graph isomorphism. II.
• The traveling salesman problem on cubic and subcubic graphs
• On the 2-factors of bicubic graphs
• Leaf-Critical and Leaf-Stable Graphs
• Three small cubic graphs with interesting hamiltonian properties
• A class of Hamiltonian polytopes
• Covering 2‐connected 3‐regular graphs with disjoint paths
• Paths, Stars and the Number Three
• Spanning k-ended trees of 3-regular connected graphs
• The Generation of Fullerenes
• Approximating Graphic TSP by Matchings
• On Hamiltonian Circuits