Check nearby libraries
Buy this book
Bestselling author Kris Radish takes the emotional measure of mothers, daughters, sisters, and friends in her wise and wonderful new novel of a woman unsure if she's on the verge of a breakdown--or a breakthrough....After all these years is there any way you would see me again? When Emma Lauryn Gilford heard the voice on her answering machine, she thought, How dare he? She's put a lot of distance between herself and Samuel, filling her life with work and family, lavishing her attention on her lovely nieces and a garden that's the pride of Higgins, South Carolina. So why does his voice still have the power to make her heart skip? Why can't she stop thinking about this man she'd forgotten so long ago?Emma has always been the dependable daughter, the mediator of the controlled chaos always surrounding her high-strung sisters and her widowed mother, Higgins's own senior citizen seductress. But with the annual Gilford family reunion just around the corner, at least two of her sisters approaching meltdown, and her favorite teenage niece taking sanctuary in her home, Emma's concrete wall of self-denial is showing cracks. And on the other side is a life she can't put off living a moment longer.From the Trade Paperback edition.
Check nearby libraries
Buy this book
Previews available in: English
Edition | Availability |
---|---|
1 |
zzzz
|
2
The Shortest Distance Between Two Women
2009, Random House Publishing Group
E-book
in English
0553906216 9780553906219
|
zzzz
|
3 |
aaaa
|
Book Details
Edition Notes
Classifications
The Physical Object
ID Numbers
Source records
Library of Congress MARC recordLibrary of Congress MARC record
Library of Congress MARC record
Library of Congress MARC record
Library of Congress MARC record
Internet Archive item record
Better World Books record
Library of Congress MARC record
Internet Archive item record
harvard_bibliographic_metadata record
Promise Item
Community Reviews (0)
Feedback?History
- Created May 15, 2009
- 18 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
January 15, 2023 | Edited by ImportBot | import existing book |
December 31, 2022 | Edited by MARC Bot | import existing book |
August 19, 2021 | Edited by MARC Bot | import existing book |
December 23, 2020 | Edited by MARC Bot | import existing book |
May 15, 2009 | Created by ImportBot | Imported from Library of Congress MARC record |