Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Hamiltonian path

Known as: Hamiltonian cycle, Hamilton cycle, Rudrata cycle 
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Has sociology become more socially integrated over the last 30 years? Recent work in the sociology of knowledge demonstrates a… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
  • G. Hill
  • Animal Behaviour
  • 1990
  • Corpus ID: 53176725
Abstract Male house finches, Carpodacus mexicanus , vary in plumage coloration from pale yellow to bright red. Mate preferences… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
  • A. Yao
  • FOCS
  • 1986
  • Corpus ID: 52818943
In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
We define the set of planar boolean formulae, and then show that the set of true quantified planar formulae is polynomial space… Expand
  • figure 2
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1982
Highly Cited
1982
A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.4
  • figure 2.6
  • figure 2.7
Is this relevant?
Highly Cited
1976
Highly Cited
1976
We consider the problem of determining whether a planar, cubic, triply-connected graph G has a Hamiltonian circuit. We show that… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1973
Highly Cited
1973
The toughness of a graph G is defined as the largest real number t such that deletion of any s points from G results in a graph… Expand
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1972
Highly Cited
1972
Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has no… Expand
Is this relevant?