Cycle (graph theory)

Known as: Cycle (graph), Simple cycle, Closed walk 
In graph theory, there are several different types of objects called cycles, principally a closed walk and a simple cycle; also, e.g., an element of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
When you look back over the past half-century in the United States you see a remarkable secular change in the housing cycle. Most… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Received: 18 May 2005 Revised: 19 June 2005 Accepted: 9 January 2006 Abstract In turbulent environments, enterprise agility, that… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider a heterogeneous sensor network in which nodes are to be deployed over a unit area for the purpose of surveillance. An… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The concept of resilience has evolved considerably since Holling’s (1973) seminal paper. Different interpretations of what is… (More)
  • figure 1
  • figure 1
  • figure 2
Is this relevant?
1997
1997
 If G is an n vertex maximal planar graph and δ≤1 3, then the vertex set of G can be partitioned into three sets A, B, C such… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A time-hopping modulation format employing impulse signal technology has several features which may make it attractive for… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1989
1989
A Hamiltonian cycle (path) of a graph G is a simple cycle (path) which contains all the vertices of G. The Hamiltonian cycle… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We show that every 2-connected triangulated planar graph with n vertices has a simple cycle C of length at most 2 J2 n which… (More)
Is this relevant?
1983
1983
1.1. Definitions All graphs considered are finite, and may contain loops and multiple edges. Let G be a graph. For S g V(G), we… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Notation: For a graph G = (V, E), n will denote the number of vertices and m the number of edges. 1. Given a graph G = (V, E… (More)
Is this relevant?