On non-traceable, non-hypotraceable, arachnoid graphs

DOI10.1016/j.endm.2015.06.084zbMath1346.05138OpenAlexW1897637858MaRDI QIDQ322337

Gábor Wiener

Publication date: 14 October 2016

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

zbMATH Keywords

spanning treeHamiltonian patharachnoid graphhypotraceable graphspanning spider

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar and infinite hypohamiltonian and hypotraceable graphs
• Hypohamiltonian and hypotraceable graphs
• On longest paths and circuits in graphs.
• On Detours in Graphs¹
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen