# Cycle (graph theory)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

- 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

- EJIS
- 2006

Received: 18 May 2005 Revised: 19 June 2005 Accepted: 9 January 2006 Abstract In turbulent environments, enterprise agility, thatâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Mobile Computing
- 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)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

The concept of resilience has evolved considerably since Hollingâ€™s (1973) seminal paper. Different interpretations of what isâ€¦Â (More)

Is this relevant?

1997

1997

- Acta Informatica
- 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)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- 1993

A time-hopping modulation format employing impulse signal technology has several features which may make it attractive forâ€¦Â (More)

Is this relevant?

1989

1989

- J. Algorithms
- 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)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- J. Comput. Syst. Sci.
- 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

- J. Comb. Theory, Ser. B
- 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)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- 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?