Discover all artworks by Johan Dijkstra (Dutch, 1896 - 1978) on MutualArt along with auctions, exhibitions and articles featuring the artist.
Johan Dijkstra, omslag Trijntje Soldaats
Discover all artworks by Johan Dijkstra (Dutch, 1896 - 1978) on MutualArt along with auctions, exhibitions and articles featuring the artist.
View Termunten aan de Eems, Groningen (Circa 1950) By Dijkstra Johan; oil on canvas; 60 x 99.5 cm; Signed; . Access more artwork lots and estimated & realized auction prices on MutualArt.
View A country road in Groningen (Circa 1930) By Dijkstra Johan; oil on canvas; 56.5 x 71.5 cm; Signed; . Access more artwork lots and estimated & realized auction prices on MutualArt.
View Orchard By Dijkstra Johan; Oil on canvas; 60 x 80 cm; Signed; . Access more artwork lots and estimated & realized auction prices on MutualArt.
View Orchard By Dijkstra Johan; Oil on canvas; 60 x 80 cm; Signed; . Access more artwork lots and estimated & realized auction prices on MutualArt.
View Korenbindster By Dijkstra Johan; mixed media; 43 x 27 cm; . Access more artwork lots and estimated & realized auction prices on MutualArt.
The photographer’s major retrospective, at Louisiana Museum of Modern Art in Denmark, is a testament to the now-trademark natural she coaxes in her subjects
De Stichting De Ploeg heeft het doel fondsen te werven om werk van leden van Kunstenaarskring De Ploeg een prominente plek binnen de collectie van het Groninger Museum te laten behouden.
Ritadijkstra.nl
Rita dijkstra
Posts about Rineke Dijkstra Olivier written by Dr Marcus Bunyan
Sold: Space age floor lamp by Dijkstra Lampen, 1960s | #60547
Create Agency is a creative production agency for illustration, photography, CGI, animation and represents some of the best artists in the advertising industry.
Dijkstra’s Shortest Path Algorithm is an algorithm used to find the shortest path between two nodes of a weighted graph. Before investigating this algorithm make sure you are familiar with the terminology used when describing Graphs in Computer Science. Let's decompose the Dijkstra's Shortest Path Algorithm step by step using the following example: (Use the
