AbstractEmbeddings of 4-regular graphs into 3-space are examined by studying graph diagrams, i.e., projections of embedded graphs to an appropriate plane. An invariant of graph diagrams, first introduced by Yokota, is re-formulated and used to show that reduced alternating diagrams have minimal crossing number. The results presented here extend some of the so-called Tait Conjectures
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an eve...
We study the existence of edges having few crossings with the other edges in drawings of the complet...
We study the existence of edges having few crossings with the other edges in drawings of the complet...
AbstractEmbeddings of 4-regular graphs into 3-space are examined by studying graph diagrams, i.e., p...
AbstractTait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be...
AbstractTait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be...
AbstractIn this paper we generalize the concept of alternating knots to alternating graphs and show ...
One of the Tait conjectures, which was stated 100 years ago and proved in the 1980’s, said that redu...
AbstractWe show that two classical theorems in graph theory and a simple result concerning the inter...
We show that two classical theorems in graph theory and a simple result concerning the interlace pol...
We call a simple graph G a 4-cycled graph if either it has no edges or every edge of it is contained...
Explicit expressions are considered for the generating functions concerning the number of planar dia...
noneFor 66 years, research on the four-color theorem was dominated by Tait's Hamiltonian graph conje...
AbstractWe study the existence of edges having few crossings with the other edges in drawings of the...
We revoke the problem of drawing graphs in the plane so that only certain specified pairs of edges a...
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an eve...
We study the existence of edges having few crossings with the other edges in drawings of the complet...
We study the existence of edges having few crossings with the other edges in drawings of the complet...
AbstractEmbeddings of 4-regular graphs into 3-space are examined by studying graph diagrams, i.e., p...
AbstractTait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be...
AbstractTait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be...
AbstractIn this paper we generalize the concept of alternating knots to alternating graphs and show ...
One of the Tait conjectures, which was stated 100 years ago and proved in the 1980’s, said that redu...
AbstractWe show that two classical theorems in graph theory and a simple result concerning the inter...
We show that two classical theorems in graph theory and a simple result concerning the interlace pol...
We call a simple graph G a 4-cycled graph if either it has no edges or every edge of it is contained...
Explicit expressions are considered for the generating functions concerning the number of planar dia...
noneFor 66 years, research on the four-color theorem was dominated by Tait's Hamiltonian graph conje...
AbstractWe study the existence of edges having few crossings with the other edges in drawings of the...
We revoke the problem of drawing graphs in the plane so that only certain specified pairs of edges a...
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an eve...
We study the existence of edges having few crossings with the other edges in drawings of the complet...
We study the existence of edges having few crossings with the other edges in drawings of the complet...
DOI
Add to ORKG