Spiders everywhere

DOI10.1016/J.DAM.2020.11.017zbMATH Open1454.05068OpenAlexW4210373649MaRDI QIDQ2217501FDOQ2217501

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

Publication date: 29 December 2020

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

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

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

zbMATH Keywords

Hamiltonian pathspanning treehypotraceable

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• On non-traceable, non-hypotraceable, arachnoid graphs
• Spiders can be recognized by counting their legs
• Title not available (Why is that?)
• 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)