Sciweavers

81
Voted
DAM
2010
167views more  DAM 2010»
14 years 10 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
59
Voted
CORR
2010
Springer
111views Education» more  CORR 2010»
14 years 10 months ago
Rigidity of Graph Joins and Hendrickson's Conjecture
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined gr...
Timothy Sun, Chun Ye