Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4657451 | Journal of Combinatorial Theory, Series B | 2007 | 9 Pages |
Abstract
We introduce a concept of a semiextension of a cycle, and we conjecture a simple necessary and sufficient condition for its existence. It is shown that our conjecture implies a strong form of the circuit double cover conjecture. We prove that the conjecture is equivalent to its restriction to cubic graphs, and we show that it holds for every cycle which is a spanning subgraph of the given graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics