TR-2010-11

Highly connected molecular graphs are rigid in three dimensions

Tibor Jordán

Published in:
Information Processing Letters Volume 112, Issue 8-9, April, 2012, Pages 356-359



Abstract

We show that every 7-vertex-connected molecular graph is generically rigid in three dimensions. This verifies a special case of a conjecture of Lovász and Yemini. For this family of graphs the bound is best possible.


Bibtex entry:

@techreport{egres-10-11,
AUTHOR = {Jord{\'a}n, Tibor},
TITLE = {Highly connected molecular graphs are rigid in three dimensions},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2010},
NUMBER = {TR-2010-11}
}


Last modification: 5.12.2018. Please email your comments to Tamás Király!