AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G such that every edge of G is an edge of exactly two subgraphs in L. Presented is a short proof of the following theorem due to Tarsi (J. Combin. Theory Ser. B 41 (1986), 332–340): Every bridgeless graph containing a Hamilton path has a 6-cycle double cover
AbstractAn orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of ...
AbstractLet G be a two-connected graph. A family F of circuits of G is called a circuit double cover...
AbstractAn orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of ...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractThe main result of this paper can be roughly described as follows. Any bridgeless cubic grap...
AbstractThe main result of this paper can be roughly described as follows. Any bridgeless cubic grap...
AbstractDefine a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which ...
AbstractA CDC (cycle double cover) of a graph G is a system (C1,…,Ck) of cycles in G such that each ...
AbstractThe long standing Cycle Double Cover Conjecture states that every bridgeless graph can be co...
AbstractKriesell [M. Kriesell, Contractions, cycle double covers and cyclic colorings in locally con...
AbstractDefine two binary matroids on the same element set to be mutually semi-dual if every cocycle...
AbstractThe oddness of a multigraph was introduced by M. Kochol and the author. It is always a nonne...
AbstractDefine two binary matroids on the same element set to be mutually semi-dual if every cocycle...
AbstractIt is shown that if a graph has a cycle double cover, then its line graph also has a cycle d...
AbstractLet H be a cubic graph admitting a 3-edge-coloring c:E(H)→Z3 such that the edges colored wit...
AbstractAn orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of ...
AbstractLet G be a two-connected graph. A family F of circuits of G is called a circuit double cover...
AbstractAn orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of ...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractThe main result of this paper can be roughly described as follows. Any bridgeless cubic grap...
AbstractThe main result of this paper can be roughly described as follows. Any bridgeless cubic grap...
AbstractDefine a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which ...
AbstractA CDC (cycle double cover) of a graph G is a system (C1,…,Ck) of cycles in G such that each ...
AbstractThe long standing Cycle Double Cover Conjecture states that every bridgeless graph can be co...
AbstractKriesell [M. Kriesell, Contractions, cycle double covers and cyclic colorings in locally con...
AbstractDefine two binary matroids on the same element set to be mutually semi-dual if every cocycle...
AbstractThe oddness of a multigraph was introduced by M. Kochol and the author. It is always a nonne...
AbstractDefine two binary matroids on the same element set to be mutually semi-dual if every cocycle...
AbstractIt is shown that if a graph has a cycle double cover, then its line graph also has a cycle d...
AbstractLet H be a cubic graph admitting a 3-edge-coloring c:E(H)→Z3 such that the edges colored wit...
AbstractAn orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of ...
AbstractLet G be a two-connected graph. A family F of circuits of G is called a circuit double cover...
AbstractAn orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of ...
DOI
Add to ORKG