Rizzi, Romeo (1999) On 4-connected graphs without even cycle decompositions. UNSPECIFIED.
![]()
| PDF Download (526Kb) | Preview |
Abstract
A circuit decomposition of a graph G=(V,E) is a partition of E into circuits. A decomposition is said even if all its circuits have even length. We give a negative answer to a question posed by Jackson asking whether K_5 is the only 4-connected eulerian graph with an even number of edges but no even circuit decomposition.
Item Type: | Departmental Technical Report |
---|---|
Department or Research center: | Information Engineering and Computer Science |
Subjects: | Q Science > QA Mathematics > QA075 Electronic computers. Computer science |
Uncontrolled Keywords: | even circuit decomposition, eulerian graph, K_5. |
Additional Information: | Published in: Discrete Mathematics 234 (2001) 181-186. |
Report Number: | DIT-02-050 |
Repository staff approval on: | 10 Jul 2002 |
Actions (login required)
View Item |