AbstractIn this paper we give a new proof of the well-known theorem of Kuratowski-Pontrjagin on planar graphs: A graph is planar iff it does not contain a subgraph homeomorphic to K5 or K3,3
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
In this thesis we study planar graphs, in particular, maximal planar graphs and general planar trian...
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
AbstractIn this paper we give a new proof of the well-known theorem of Kuratowski-Pontrjagin on plan...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
AbstractThe conjecture of Kelmans that any 3-connected non-planar graph with at least six vertices c...
AbstractThe conjecture of Kelmans that any 3-connected non-planar graph with at least six vertices c...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
AbstractIn the late 1920s several mathematicians were on the verge of discovering a theorem for char...
Abstract: A graph is called planar if it can be represented on the plane without points of intersect...
AbstractIn the late 1920s several mathematicians were on the verge of discovering a theorem for char...
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained f...
The present dissertation aims to introduce the basic concepts of graph theory to explore the concep...
We show that every triconnected planar graph of maximum degree five is subhamiltonian planar. A grap...
We show that every triconnected planar graph of maximum degree five is subhamiltonian planar. A grap...
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
In this thesis we study planar graphs, in particular, maximal planar graphs and general planar trian...
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
AbstractIn this paper we give a new proof of the well-known theorem of Kuratowski-Pontrjagin on plan...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
AbstractThe conjecture of Kelmans that any 3-connected non-planar graph with at least six vertices c...
AbstractThe conjecture of Kelmans that any 3-connected non-planar graph with at least six vertices c...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
AbstractIn the late 1920s several mathematicians were on the verge of discovering a theorem for char...
Abstract: A graph is called planar if it can be represented on the plane without points of intersect...
AbstractIn the late 1920s several mathematicians were on the verge of discovering a theorem for char...
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained f...
The present dissertation aims to introduce the basic concepts of graph theory to explore the concep...
We show that every triconnected planar graph of maximum degree five is subhamiltonian planar. A grap...
We show that every triconnected planar graph of maximum degree five is subhamiltonian planar. A grap...
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
In this thesis we study planar graphs, in particular, maximal planar graphs and general planar trian...
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
DOI
Add to ORKG