wyszukanych pozycji: 3
![]() |
Non-toxic Printmaking
ISBN: 9781789940206 / Angielski / Miękka / 2020 / 128 str. Termin realizacji zamówienia: ok. 30 dni roboczych. In this book, Mark Graver puts the case for non-toxic printmaking and then discusses the various technical factors (both materials and equipment) to consider when etching with acrylic resists, making aquatints, etching in general, using drypoint, engraving, making mezzotints and collagraphs and using photopolymers as well as combining various printmaking techniques. There is also information on various inks and health and safety measures in the printing workshop. All in all, this book contains everything you need to know to clean up your printmaking practice.
In this book, Mark Graver puts the case for non-toxic printmaking and then discusses the various technical factors (both materials and equipment) to...
|
cena:
128,36 |
![]() |
Aretta's Gift
ISBN: 9780983494713 / Angielski / Miękka / 2011 / 170 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych. When Aretta is asked to do what she considers unthinkable, her whole world is turned upside down, but she is not the only one who is affected by the course she chooses: In Aretta s Gift, a myth is born in which everything that the Queen of Lydia once knew is called into question, and facing the truth is not going to be easy. How can anyone triumph when fate herself seems out to harm them? When the queen finds the truth, she soon realizes that it was right in front of her eyes.
When Aretta is asked to do what she considers unthinkable, her whole world is turned upside down, but she is not the only one who is affected by the c...
|
cena:
30,20 |
![]() |
Locally Finite Planar Edge-Transitive Graphs
ISBN: 9780821805565 / Angielski Termin realizacji zamówienia: ok. 22 dni roboczych. The nine finite, planar, 3-connected, edge-transitive graphs have been known and studied for many centuries. The infinite, locally finite, planar, 3-connected, edge-transitive graphs can be classified according to the number of their ends (the supremum of the number of infinite components when a finite subgraph is deleted). Prior to this study the 1-ended graphs in this class were identified by Grunbaum and Shephard as 1-skeletons of tessellations of the hyperbolic plane; Watkins characterized the 2-ended members. Any remaining graphs in this class must have uncountably many ends. In this...
The nine finite, planar, 3-connected, edge-transitive graphs have been known and studied for many centuries. The infinite, locally finite, planar, 3-c...
|
cena:
199,99 |