Gallai's question and constructions of almost hypotraceable graphs
type: Item
instance of: scholarly article
title: Gallai's question and constructions of almost hypotraceable graphs
zbMATH Open document ID: 1387.05072
author: Gábor Wiener
author: Carol T. Zamfirescu
published in: Discrete Applied Mathematics
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6872397
zbMATH Keywords: Gallai's problem
zbMATH Keywords: traceable
zbMATH Keywords: hypotraceable
zbMATH Keywords: almost hypotraceable
describes a project that uses: GenHypohamiltonian
MaRDI profile type: Publication
full work available at URL: j.dam.2018.02.017
OpenAlex ID: W2789511124
cites work: On cubic planar hypohamiltonian and hypotraceable graphs
cites work: Longest Paths in Circular Arc Graphs
cites work: Nonempty intersection of longest paths in series-parallel graphs
cites work: Flip-Flops in Hypohamiltonian Graphs
cites work: Systematic searches for hypohamiltonian graphs
cites work: Q5537559
cites work: Spanning spiders and light-splitting switches
cites work: Infinitely many planar cubic hypohamiltonian graphs of girth 5
cites work: Improved bounds for hypohamiltonian graphs
cites work: Vertices missed by longest paths or circuits
cites work: Q5286666
cites work: Planar Hypohamiltonian Graphs on 40 Vertices
cites work: On Detours in Graphs1
cites work: Q3199444
cites work: Transversals of Longest Paths and Cycles
cites work: Über längste Wege und Kreise in Graphen
cites work: Intersecting longest paths and longest cycles: A survey
cites work: Measurements of edge-uncolorability
cites work: Hypohamiltonian and hypotraceable graphs
cites work: On hypohamiltonian graphs
cites work: Planar and infinite hypohamiltonian and hypotraceable graphs
cites work: Q4146745
cites work: Planar cubic hypohamiltonian and hypotraceable graphs
cites work: Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
cites work: Q4775880
cites work: On non-traceable, non-hypotraceable, arachnoid graphs
cites work: On constructions of hypotraceable graphs
cites work: Leaf-Critical and Leaf-Stable Graphs
cites work: New constructions of hypohamiltonian and hypotraceable graphs
cites work: On planar hypohamiltonian graphs
cites work: On Hypohamiltonian and Almost Hypohamiltonian Graphs
cites work: Seven Problems on Hypohamiltonian and Almost Hypohamiltonian Graphs
cites work: A planar hypohamiltonian graph with 48 vertices
cites work: On longest paths and circuits in graphs.
Wikidata QID: Q130070673
DOI: 10.1016/J.DAM.2018.02.017
Recommended article: On constructions of hypotraceable graphs
Recommended article: On Hypohamiltonian and Almost Hypohamiltonian Graphs
Recommended article: On almost hypohamiltonian graphs
Recommended article: New constructions of hypohamiltonian and hypotraceable graphs
Recommended article: Q3318807
Recommended article: Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
Recommended article: Gallai graphs and anti-Gallai graphs
Recommended article: Q4186360
Recommended article: Gallai theorems for graphs, hypergraphs, and set systems
Recommended article: On Construction of Almost-Ramanujan Graphs
description: scientific article; zbMATH DE number 6872397