On non-traceable, non-hypotraceable, arachnoid graphs

DOI10.1016/J.ENDM.2015.06.084zbMATH Open1346.05138OpenAlexW1897637858MaRDI QIDQ322337FDOQ322337

Gábor Wiener

Publication date: 14 October 2016

Full work available at URL: http://real.mtak.hu/40393/1/eurocomb15wiener.pdf

zbMATH Keywords

Hamiltonian pathspanning treearachnoid graphhypotraceable graphspanning spider

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• On Detours in Graphs¹
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Title not available (Why is that?)
• Hypohamiltonian and hypotraceable graphs
• Planar and infinite hypohamiltonian and hypotraceable graphs
• On longest paths and circuits in graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Spiders everywhere
• On the minimum leaf number of cubic graphs
• Gallai's question and constructions of almost hypotraceable graphs
• On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
• Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs
• Extremal traceable graphs with non-traceable edges
• Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian

This page was built for publication: On non-traceable, non-hypotraceable, arachnoid graphs

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