AbstractIt has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that bridgeless line graphs of complete graphs, complete bipartite graphs, and planar graphs have small cycle double covers. In this paper, we extend the result for complete bipartite graphs, and show that the line graph of any complete multipartite graph (other than K1,2) has a small cycle double cover
AbstractWe consider two problems related to the cycle double cover (CDC) conjecture for graphs: the ...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
In the present note, (n, r, c)-covers with n = (2r - 1)c and bipartite double covers of complete gra...
AbstractIt has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that brid...
AbstractIt is shown that if a graph has a cycle double cover, then its line graph also has a cycle d...
AbstractThe main result of this paper can be roughly described as follows. Any bridgeless cubic grap...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractWe prove that any bridgeless graph G = (V, E), |E| = m, |V| = N, admits a cycle cover of tot...
AbstractLet G be a two-connected graph. A family F of circuits of G is called a circuit double cover...
The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless gra...
AbstractA cocycle (resp. cycle) cover of a graph G is a family C of cocycles (resp. cycles) of G suc...
AbstractKriesell [M. Kriesell, Contractions, cycle double covers and cyclic colorings in locally con...
A classic algorithm for the traveling salesman problem (TSP) on cubic graphs consists of finding a d...
Abstract In this paper, we show that for any simple, bridgeless graph G on n vertices, there is a fa...
AbstractThe long standing Cycle Double Cover Conjecture states that every bridgeless graph can be co...
AbstractWe consider two problems related to the cycle double cover (CDC) conjecture for graphs: the ...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
In the present note, (n, r, c)-covers with n = (2r - 1)c and bipartite double covers of complete gra...
AbstractIt has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that brid...
AbstractIt is shown that if a graph has a cycle double cover, then its line graph also has a cycle d...
AbstractThe main result of this paper can be roughly described as follows. Any bridgeless cubic grap...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractWe prove that any bridgeless graph G = (V, E), |E| = m, |V| = N, admits a cycle cover of tot...
AbstractLet G be a two-connected graph. A family F of circuits of G is called a circuit double cover...
The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless gra...
AbstractA cocycle (resp. cycle) cover of a graph G is a family C of cocycles (resp. cycles) of G suc...
AbstractKriesell [M. Kriesell, Contractions, cycle double covers and cyclic colorings in locally con...
A classic algorithm for the traveling salesman problem (TSP) on cubic graphs consists of finding a d...
Abstract In this paper, we show that for any simple, bridgeless graph G on n vertices, there is a fa...
AbstractThe long standing Cycle Double Cover Conjecture states that every bridgeless graph can be co...
AbstractWe consider two problems related to the cycle double cover (CDC) conjecture for graphs: the ...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
In the present note, (n, r, c)-covers with n = (2r - 1)c and bipartite double covers of complete gra...