Algorithms for long paths in graphs
type: Item
instance of: scholarly article
title: Algorithms for long paths in graphs
zbMATH Open document ID: 1117.68057
author: Zhao Zhang
author: Hao Li
published in: Theoretical Computer Science
publication date: 2007-06-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5161880
zbMATH Keywords: Hamiltonian
zbMATH Keywords: long path
zbMATH Keywords: neighborhood condition
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.02.012
OpenAlex ID: W2004084580
cites work: Q3475293
cites work: Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
cites work: On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
cites work: Q4094891
cites work: Finding a Path of Superlogarithmic Length
cites work: On Linear Time Minor Tests with Depth-First Search
cites work: Q5422499
cites work: Some Theorems on Abstract Graphs
cites work: Finding long paths and cycles in sparse Hamiltonian graphs
cites work: Hamiltonism, degree sum and neighborhood intersections
cites work: Q4312266
cites work: Combinatorial optimization. Theory and algorithms
cites work: On approximating the longest path in a graph
cites work: Q3740256
cites work: Note on Hamilton Circuits
cites work: Q4952685
cites work: Longest cycles in 3-connected graphs
DOI: 10.1016/J.TCS.2007.02.012
description: scientific article; zbMATH DE number 5161880