Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G, is Hamilton cycle decomposable. In this paper, we construct a perfect set of Euler tours for the complete tripartite graph Kp,p,p for any prime p and hence prove Bermond’s conjecture for G = Kp,p,p
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
We prove that all connected vertex-transitive graphs of order p 2, p a prime, can be decomposed into...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
AbstractIn this paper it is proved that if a graph G has a decomposition into an even (resp., odd) n...
AbstractHajós’ conjecture asserts that a simple eulerian graph on n vertices can be decomposed into ...
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 G1 and G2 be graphs that are decomposable into Hamilton cycles. Bermond (1978), generali...
AbstractTwo Euler tours of a graph G are compatible if no pair of adjacent edges of G are consecutiv...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractWe prove that the only obstacle for the graph of all linear extensions of a poset, consistin...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to ha...
AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, whic...
We prove that all connected vertex-transitive graphs of order p2, p a prime, can be decomposed into ...
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
We prove that all connected vertex-transitive graphs of order p 2, p a prime, can be decomposed into...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
AbstractIn this paper it is proved that if a graph G has a decomposition into an even (resp., odd) n...
AbstractHajós’ conjecture asserts that a simple eulerian graph on n vertices can be decomposed into ...
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 G1 and G2 be graphs that are decomposable into Hamilton cycles. Bermond (1978), generali...
AbstractTwo Euler tours of a graph G are compatible if no pair of adjacent edges of G are consecutiv...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractWe prove that the only obstacle for the graph of all linear extensions of a poset, consistin...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to ha...
AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, whic...
We prove that all connected vertex-transitive graphs of order p2, p a prime, can be decomposed into ...
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
We prove that all connected vertex-transitive graphs of order p 2, p a prime, can be decomposed into...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
DOI
Add to ORKG