Gallai's question and constructions of almost hypotraceable graphs
From MaRDI portal
Publication:1752468
DOI10.1016/j.dam.2018.02.017zbMath1387.05072OpenAlexW2789511124WikidataQ130070673 ScholiaQ130070673MaRDI QIDQ1752468
Gábor Wiener, Carol T. Zamfirescu
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.017
Related Items
On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs, Bonds Intersecting Long Paths in \(k\) -Connected Graphs, Spiders everywhere, Intersection of longest paths in graph classes, Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs, $K_2$-Hamiltonian Graphs: I
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On non-traceable, non-hypotraceable, arachnoid graphs
- On constructions of hypotraceable graphs
- On cubic planar hypohamiltonian and hypotraceable graphs
- Nonempty intersection of longest paths in series-parallel graphs
- Planar and infinite hypohamiltonian and hypotraceable graphs
- Über längste Wege und Kreise in Graphen
- Planar cubic hypohamiltonian and hypotraceable graphs
- Hypohamiltonian and hypotraceable graphs
- Measurements of edge-uncolorability
- On hypohamiltonian graphs
- Spanning spiders and light-splitting switches
- Vertices missed by longest paths or circuits
- Planar Hypohamiltonian Graphs on 40 Vertices
- Leaf-Critical and Leaf-Stable Graphs
- On planar hypohamiltonian graphs
- A planar hypohamiltonian graph with 48 vertices
- On longest paths and circuits in graphs.
- Systematic searches for hypohamiltonian graphs
- Infinitely many planar cubic hypohamiltonian graphs of girth 5
- Improved bounds for hypohamiltonian graphs
- New constructions of hypohamiltonian and hypotraceable graphs
- Longest Paths in Circular Arc Graphs
- Transversals of Longest Paths and Cycles
- Intersecting longest paths and longest cycles: A survey
- On Hypohamiltonian and Almost Hypohamiltonian Graphs
- Seven Problems on Hypohamiltonian and Almost Hypohamiltonian Graphs
- On Detours in Graphs1
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
- Flip-Flops in Hypohamiltonian Graphs
