#### Filter Results:

#### Publication Year

2010

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A graph G has the hourglass property if every induced hourglass S (a tree with a degree sequence 22224) contains two non-adjacent vertices which have a common neighbor in G − V (S). For an integer k ≥ 4, a graph G has the single k-cycle property if every edge of G, which does not lie in a triangle, lies in a cycle C of order at most k such that C has at… (More)

- ‹
- 1
- ›