For purpose of this paper research has been done on the topic of theoretical features of snark graphs, as well as research regarding some well known snarks and their special features. Graph G consists of a nonempty, finite set of vertices V(G) and a finite set E(G) consisting of binomal subsets of set V(G) which we call edges. A snark is a graph that is simple, connected, has no bridges, is 3-regular and has a chromatic index of 4. A graf is simple if there are no loops in it and there are no multiple edges between two vertices. A graph is connected if there is a path from any one vertex to any other vertex. An edge in a graph is a bridge if the graph becomes unconnected by removing that edge from the graph. A graph is k-regular if all vertices of the graph are of degree k. A graph is 3-regular if all vertices of the graph are of degree 3. Chromatic index of a graph is the minimum number of colors necessary to color the graph so no incident edges are of the same color. Some well known examples of such graphs are: Petersen graph, Blanuša snarks, Double-star snark, Szekeres snark, Watkins snark, Descartes snark, An infinite family of flower snarks. An application with a graphical interface has been developed to give users a simple way of checking the features of a graph which they draw. For all that knowledge of discrete mathematics has been used, as well as skills regarding solving of alghorithmic problems through code.