Vulnerability bounds on the number of spanning tree leaves

From MaRDI portal

Revision as of 21:56, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3184286

Jump to:navigation, search

DOI10.26493/1855-3974.37.5b9zbMath1207.05203OpenAlexW1785087831WikidataQ129362652 ScholiaQ129362652MaRDI 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

vulnerability Hamiltonicity Hamiltonian path spanning tree leaves

Mathematics Subject Classification ID

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

Related Items (2)

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

This page was built for publication: Vulnerability bounds on the number of spanning tree leaves

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3184286&oldid=16288584"