AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, which was introduced by Kotzig in 1966 (in “Theory of Graphs” (P. Erdös and G. Katona, Eds.), Proc., Colloq., Tihany, Hungary, September, 1966, Akad. Kaido, Hungarian Academy of Sciences, Budapest, 1968) and prove that any edge in an Euler tour graph is in a Hamilton cycle
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractTwo Euler tours of a graph G are compatible if no pair of adjacent edges of G are consecutiv...
AbstractIn this paper we define the directed Euler tour graph of a directed Eulerian graph by T-tran...
AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, whic...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
AbstractLet D be a directed Eulerian multigraph, v be a vertex of D. We call the common value of id(...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G, is Ham...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
There are two topics in graph theory with a long history, both of which involve traversing graphs, o...
This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian c...
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Ham...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractTwo Euler tours of a graph G are compatible if no pair of adjacent edges of G are consecutiv...
AbstractIn this paper we define the directed Euler tour graph of a directed Eulerian graph by T-tran...
AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, whic...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
AbstractLet D be a directed Eulerian multigraph, v be a vertex of D. We call the common value of id(...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G, is Ham...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
There are two topics in graph theory with a long history, both of which involve traversing graphs, o...
This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian c...
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Ham...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractTwo Euler tours of a graph G are compatible if no pair of adjacent edges of G are consecutiv...
DOI
Add to ORKG