DOIAbstract
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋ circuits such that each edge is covered an odd number of times. This settles a conjecture made by Chung in 1980
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋ circuits such that each edge is covered an odd number of times. This settles a conjecture made by Chung in 1980
AbstractWe characterize the graphs that admit a decomposition into circuits, i.e. finite or infinite...
AbstractWe give a common generalization of P. Seymour's “Integer sum of circuits” theorem and the fi...
AbstractThe oddness of a multigraph was introduced by M. Kochol and the author. It is always a nonne...
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋...
AbstractLetGbe a 2-edge-connected graph withmedges andnvertices. The following two conjectures are p...
AbstractHajós’ conjecture asserts that a simple eulerian graph on n vertices can be decomposed into ...
AbstractAn equivalent statement of the circuit double cover conjecture is that every bridgeless grap...
AbstractAn equivalent statement of the circuit double cover conjecture is that every bridgeless grap...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractThe long standing Cycle Double Cover Conjecture states that every bridgeless graph can be co...
AbstractIt was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by ...
AbstractIt was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by ...
AbstractWe prove that every connected graph onnvertices can be covered by at mostn/2+O(n3/4) paths. ...
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...
AbstractWe characterize the graphs that admit a decomposition into circuits, i.e. finite or infinite...
AbstractWe give a common generalization of P. Seymour's “Integer sum of circuits” theorem and the fi...
AbstractThe oddness of a multigraph was introduced by M. Kochol and the author. It is always a nonne...
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋...
AbstractLetGbe a 2-edge-connected graph withmedges andnvertices. The following two conjectures are p...
AbstractHajós’ conjecture asserts that a simple eulerian graph on n vertices can be decomposed into ...
AbstractAn equivalent statement of the circuit double cover conjecture is that every bridgeless grap...
AbstractAn equivalent statement of the circuit double cover conjecture is that every bridgeless grap...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractThe long standing Cycle Double Cover Conjecture states that every bridgeless graph can be co...
AbstractIt was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by ...
AbstractIt was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by ...
AbstractWe prove that every connected graph onnvertices can be covered by at mostn/2+O(n3/4) paths. ...
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...
AbstractWe characterize the graphs that admit a decomposition into circuits, i.e. finite or infinite...
AbstractWe give a common generalization of P. Seymour's “Integer sum of circuits” theorem and the fi...
AbstractThe oddness of a multigraph was introduced by M. Kochol and the author. It is always a nonne...
Add to ORKG