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 circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractLet G be a graph and let D1(G) be the set of vertices of degree 1 in G. Veldman (1994) prove...
AbstractLet C(l,k) denote a class of 2-edge-connected graphs of order n such that a graph G∈C(l,k) i...
AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, whic...
AbstractIn this paper we define the directed Euler tour graph of a directed Eulerian graph by T-tran...
AbstractLet D be a directed Eulerian multigraph, v be a vertex of D. We call the common value of id(...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractLet D be a directed Eulerian multigraph, v be a vertex of D. We call the common value of id(...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
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...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractLet G be a graph and let D1(G) be the set of vertices of degree 1 in G. Veldman (1994) prove...
AbstractLet C(l,k) denote a class of 2-edge-connected graphs of order n such that a graph G∈C(l,k) i...
AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, whic...
AbstractIn this paper we define the directed Euler tour graph of a directed Eulerian graph by T-tran...
AbstractLet D be a directed Eulerian multigraph, v be a vertex of D. We call the common value of id(...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractLet D be a directed Eulerian multigraph, v be a vertex of D. We call the common value of id(...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
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...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractLet G be a graph and let D1(G) be the set of vertices of degree 1 in G. Veldman (1994) prove...
AbstractLet C(l,k) denote a class of 2-edge-connected graphs of order n such that a graph G∈C(l,k) i...
DOI
Add to ORKG
_10.jpg%3Fwidth%3D300&w=3840&q=75)
