AbstractKriesell [M. Kriesell, Contractions, cycle double covers and cyclic colorings in locally connected graphs, J. Combin. Theory Ser. B 96 (2006) 881–900] proved the cycle double cover conjecture for locally connected graphs. In this note, we give much shorter proofs for two stronger results
AbstractThe oddness of a multigraph was introduced by M. Kochol and the author. It is always a nonne...
AbstractEvery 2-connected simple cubic graph of order n⩾6 has a cycle cover with at most ⌈n/4⌉ cycle...
AbstractLet G be a graph with odd edge-connectivity r. It is proved in this paper that if r>3, then ...
AbstractKriesell [M. Kriesell, Contractions, cycle double covers and cyclic colorings in locally con...
AbstractIn this paper, we obtained some necessary and sufficient conditions for a graph having 5-, 6...
AbstractA finite, undirected graph is called locally connected, if the neighborhood of every vertex ...
My research focuses on two famous problems in graph theory, namely the cycle double cover conjecture...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractIn this paper, we obtained some necessary and sufficient conditions for a graph having 5-, 6...
AbstractResults related to integer flows and cycle covers are presented. A cycle cover of a graph G ...
AbstractResults related to integer flows and cycle covers are presented. A cycle cover of a graph G ...
AbstractWe prove that a cubic 2-connected graph which has a 2-factor containing exactly 4 odd cycles...
AbstractThe assertion of the long standing cycle double cover conjecture is shown to be true if eith...
AbstractDefine a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which ...
AbstractIt is shown that if a graph has a cycle double cover, then its line graph also has a cycle d...
AbstractThe oddness of a multigraph was introduced by M. Kochol and the author. It is always a nonne...
AbstractEvery 2-connected simple cubic graph of order n⩾6 has a cycle cover with at most ⌈n/4⌉ cycle...
AbstractLet G be a graph with odd edge-connectivity r. It is proved in this paper that if r>3, then ...
AbstractKriesell [M. Kriesell, Contractions, cycle double covers and cyclic colorings in locally con...
AbstractIn this paper, we obtained some necessary and sufficient conditions for a graph having 5-, 6...
AbstractA finite, undirected graph is called locally connected, if the neighborhood of every vertex ...
My research focuses on two famous problems in graph theory, namely the cycle double cover conjecture...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractIn this paper, we obtained some necessary and sufficient conditions for a graph having 5-, 6...
AbstractResults related to integer flows and cycle covers are presented. A cycle cover of a graph G ...
AbstractResults related to integer flows and cycle covers are presented. A cycle cover of a graph G ...
AbstractWe prove that a cubic 2-connected graph which has a 2-factor containing exactly 4 odd cycles...
AbstractThe assertion of the long standing cycle double cover conjecture is shown to be true if eith...
AbstractDefine a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which ...
AbstractIt is shown that if a graph has a cycle double cover, then its line graph also has a cycle d...
AbstractThe oddness of a multigraph was introduced by M. Kochol and the author. It is always a nonne...
AbstractEvery 2-connected simple cubic graph of order n⩾6 has a cycle cover with at most ⌈n/4⌉ cycle...
AbstractLet G be a graph with odd edge-connectivity r. It is proved in this paper that if r>3, then ...
DOI
Add to ORKG