| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9911100494103321 |
|
|
Autore |
Potter Hillary <1969-> |
|
|
Titolo |
Battle cries : Black women and intimate partner abuse / / Hillary Potter |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
New York, : New York University Press, c2008 |
|
|
|
|
|
|
|
ISBN |
|
9780814768471 |
0814768474 |
9780814767719 |
0814767710 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (286 p.) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Intimate partner violence - United States |
African American women - Abuse of |
Abused women - United States |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (p. 249-267) and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Frontmatter -- Contents -- Acknowledgments -- 1. Introduction -- 2. Black Feminist Criminology and the Power of Narrative -- 3. Dynamic Resistance -- 4. Surviving Childhood -- 5. Living Through It -- 6. Fighting Back -- 7. Getting Out -- 8. Conclusion -- Appendix A -- Appendix B -- Notes -- Bibliography -- Index -- About the Author |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Contrary to the stereotype of the “strong Black woman,” African American women are more plagued by domestic violence than any other racial group in the United States. In fact, African American women experience intimate partner violence at a rate 35% higher than white women and about two and a half times more than women of other races and ethnicities. This common portrayal can hinder black women seeking help and support simply because those on the outside don't think help is needed. Yet, as Hillary Potter argues in Battle Cries: Black Women and Intimate Partner Abuse, this stereotype often helps these African American women to resist and to verbally and physically retaliate against their abusers. Thanks to this generalization, Potter observes, black women are less inclined to label themselves as “victims” and more inclined to fight back.Battle Cries is an eye-opening examination of African American women's experiences with intimate |
|
|
|
|
|
|
|
|
|
|
|
|
|
partner abuse, the methods used to contend with abusive mates, and the immediate and enduring consequences resulting from the maltreatment. Based on intensive interviews with 40 African American women abused by their male partners, Potter's analysis takes into account variations in their experiences based on socioeconomic class, education level, and age, and discusses the common abuses and perceptions they share. Combining her remarkable findings with black feminist thought and critical race theory, Potter offers a unique and significant window through which we can better understand this understudied though rampant social problem. |
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9911136022103321 |
|
|
Autore |
Marcus Daniel A. <1945-> |
|
|
Titolo |
Graph theory : a problem oriented approach / / Daniel A. Marcus |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Washington, D.C., : Mathematical Association of America, c2008 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (222 p.) |
|
|
|
|
|
|
Collana |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di contenuto |
|
""Cover ""; ""Title page ""; ""Preface""; ""Contents""; ""Introduction""; ""Path Problems""; ""Coloring Problems""; ""Isomorphic Graphs""; ""Planar Graphs""; ""Disjoint Paths""; ""Shortest Paths""; ""... and More""; ""A Basic Concepts""; ""Equivalent Graphs""; ""Multigraphs""; ""Directed Graphs and Mixed Graphs""; ""Complete Graphs""; ""Cycle Graphs""; ""Paths in a Graph""; ""Open and Closed Paths; Cycles""; ""Subgraphs""; ""The Complement of a Graph""; ""Degrees of Vertices""; ""The Degree Sequence of a Graph""; ""Regular Graphs""; ""Connected and Disconnected Graphs"" |
""Components of a Graph""""More Problems""; ""Matrices Associated with a Graph""; ""The Degree Sequence Algorithm""; ""B Isomorphic Graphs""; ""More Problems""; ""C Bipartite Graphs""; ""Complete Bipartite Graphs""; ""Bipartite Graphs and Matrices""; ""Cycles in a |
|
|
|
|
|
|
|
|
|
|
|
Bipartite Graph""; ""Cycle Theorem for Bipartite Graphs""; ""Proof of the Cycle Theorem""; ""More Problems""; ""D Trees and Forests""; ""Pruning a Tree""; ""Directed Trees""; ""Spanning Trees""; ""Counting Spanning Trees""; ""Codewords for Trees: Prufer�s Method""; ""More Problems""; ""Three conditions"" |
""Cycles and spanning trees""""E Spanning Tree Algorithms""; ""Constructing Spanning Trees""; ""Weighted Graphs""; ""Minimal Spanning Trees""; ""Prim�s Algorithm""; ""Tables for Prim�s Algorithm""; ""The Reduction Algorithm""; ""Spanning Trees and Shortest Paths""; ""Minimal Paths in a Weighted Graph""; ""Minimal Path Algorithm, first attempt""; ""Minimal Path Algorithm, revised""; ""Tables for Dijkstra�s Algorithm""; ""Minimal Paths in a Directed Graph""; ""Negative Weights""; ""More Problems""; ""Justification of the reduction algorithm""; ""Justification of Prim�s Algorithm"" |
""Proof of the Bondy�Chvatal Theorem""""Proof of Dirac�s Theorem""; ""More Problems""; ""Proof of Posa�s Theorem""; ""H Planar Graphs""; ""Regions Formed by a Plane Diagram""; ""Proof that K_5 is Non-Planar, Using Euler�s Formula""; ""Non-Planar Graphs and Kuratowski�s Theorem""; ""More Problems""; ""I Independence and Covering""; ""The Independence Numbers of a Graph""; ""A Graph Game""; ""Covering Sets and Covering Numbers""; ""More Problems""; ""J Connections and Obstructions""; ""Internally Disjoint Paths""; ""Edge-Disjoint Paths""; ""Path Connection Numbers"" |
""Blocking Sets"" |
|
|
|
|
|
|
Sommario/riassunto |
|
"Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of approximately 360 strategically placed problems with connecting text. This is supplemented by 280 additional problems that are intended to be used as homework assignments. Concepts of graph theory are introduced, developed, and reinforced by working through leading questions posed in the problems. This problem-oriented format is intended to promote active involvement by the reader while always providing clear direction. This approach figures prominently on the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear along with concrete examples to keep the readers firmly grounded in their motivation. Spanning tree algorithms, Euler paths, Hamilton paths and cycles, planar graphs, independence and covering, connections and obstructions, and vertex and edge colorings make up the core of the book. Hall's Theorem, the Konig-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."--Back cover. |
|
|
|
|
|
|
|
| |