On minimum leaf spanning trees and a criticality notion

DOI10.1016/j.disc.2020.111884zbMath1440.05062OpenAlexW3012409507MaRDI QIDQ2182204

Gábor Wiener, Carol T. Zamfirescu, Kenta Ozeki

Publication date: 21 May 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111884

zbMATH Keywords

spanning treeleaf-criticalleaf-stableminimum leaf number

Mathematics Subject Classification ID

Trees (05C05)

Uses Software

• GenHypohamiltonian

Cites Work

• Unnamed Item
• Unnamed Item
• Planar and infinite hypohamiltonian and hypotraceable graphs
• Hypohamiltonian and hypotraceable graphs
• Spanning spiders and light-splitting switches
• On finding spanning trees with few leaves
• Planar Hypohamiltonian Graphs on 40 Vertices
• Leaf-Critical and Leaf-Stable Graphs
• On longest paths and circuits in graphs.
• Improved bounds for hypohamiltonian graphs
• New constructions of hypohamiltonian and hypotraceable graphs
• Cubic vertices in planar hypohamiltonian graphs
• On almost hypohamiltonian graphs
• On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable

This page was built for publication: On minimum leaf spanning trees and a criticality notion