# Induced path

## Papers overview

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

2016

2016

- 2016

Background: Sildenafil causes vasodilatation by relaxing the smooth muscles of blood vessels. This enhances endometrialâ€¦Â (More)

Is this relevant?

2014

2014

- Discrete Applied Mathematics
- 2014

For an integer k â‰¥ 1, a graph G is k-colorable if there exists a mapping c : VG â†’ {1, . . . , k} such that c(u) 6= c(v) wheneverâ€¦Â (More)

Is this relevant?

2013

2013

- IEEE Transactions on Image Processing
- 2013

In this paper, a space-time hole filling approach is presented to deal with a disocclusion when a view is synthesized for the 3Dâ€¦Â (More)

Is this relevant?

2006

2006

- 24th IEEE VLSI Test Symposium
- 2006

Crosstalk-induced delay should be tested for high-speed circuits. We propose a robust test generation technique based on a singleâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Circulation
- 2005

BACKGROUND
Multiple morphologies, hemodynamic instability, or noninducibility may limit ventricular tachycardia (VT) ablation inâ€¦Â (More)

Is this relevant?

2004

2004

- PODC
- 2004

We propose a general self-stabilizing scheme for solving any synchronization problem whose safety specification can be definedâ€¦Â (More)

Is this relevant?

2004

2004

- 2004

In this paper we study the length of the longest induced cycle in the unitary Cayley graph Xn = Cay(Zn; Un), where Un is theâ€¦Â (More)

Is this relevant?

2002

2002

- Discrete Mathematics
- 2002

The induced path interval J (u; v) consists of the vertices on the induced paths between u and v in a connected graph G. Diâ€¦Â (More)

Is this relevant?

2001

2001

- Journal of Graph Theory
- 2001

We show that between any two vertices of a 5-connected graph there exists an induced path whose vertices can be removed such thatâ€¦Â (More)

Is this relevant?

1989

1989

- Graphs and Combinatorics
- 1989

We present some lower and upper bounds on the length of the maximum induced paths and cycles in Kneser graphs. The Kneser graph Kâ€¦Â (More)

Is this relevant?