Spiders everywhere

DOI10.1016/J.DAM.2020.11.017MaRDI QIDQ2217501zbMATH OpenOpenAlexFDO

Authors Gábor Wiener, Maho Yokota, Carol T. Zamfirescu

Publication date 29 December 2020

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.dam.2020.11.017

zbMATH Keywords

Hamiltonian pathspanning treehypotraceable

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• On non-traceable, non-hypotraceable, arachnoid graphs
• scientific article; zbMATH DE number 2038756
• A spanning \(k\)-spider in a graph.
• Spanning spiders and light-splitting switches
• Tough spiders

Cites work

• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• scientific article; zbMATH DE number 3248752 (Why is no real title available?)
• Gallai's question and constructions of almost hypotraceable graphs
• Hypohamiltonian and hypotraceable graphs
• Leaf-critical and leaf-stable graphs
• Longest Paths in Circular Arc Graphs
• On non-traceable, non-hypotraceable, arachnoid graphs
• Smallest maximally nonhamiltonian graphs
• Spanning spiders and light-splitting switches
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

Cited in

(4)

• On non-traceable, non-hypotraceable, arachnoid graphs
• Spiders can be recognized by counting their legs
• scientific article; zbMATH DE number 6537750 (Why is no real title available?)
• Tough spiders

This page was built for publication: Spiders everywhere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217501)