Vulnerability bounds on the number of spanning tree leaves

DOI10.26493/1855-3974.37.5b9zbMath1207.05203OpenAlexW1785087831MaRDI QIDQ3184286

Gábor Salamon

Publication date: 14 October 2009

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.37.5b9

zbMATH Keywords

vulnerabilityHamiltonicityHamiltonian pathspanning tree leaves

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Complexity of independency and cliquy trees, The price of connectivity for cycle transversals