Induced path

Known as: Hole (graph theory), Induced cycle, Graph antihole 
In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced subgraph of G. That is, it is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Background: Sildenafil causes vasodilatation by relaxing the smooth muscles of blood vessels. This enhances endometrial… (More)
Is this relevant?
2014
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)
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2013
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)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2006
2006
Crosstalk-induced delay should be tested for high-speed circuits. We propose a robust test generation technique based on a single… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
BACKGROUND Multiple morphologies, hemodynamic instability, or noninducibility may limit ventricular tachycardia (VT) ablation in… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
2004
We propose a general self-stabilizing scheme for solving any synchronization problem whose safety specification can be defined… (More)
  • figure 1
  • figure 2
Is this relevant?
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)
  • figure 1
  • figure 2
Is this relevant?
2002
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2001
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
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?