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.
On 4-connected graphs without even cycle decompositions / Rizzi, Romeo. - ELETTRONICO. - (2002), pp. 1-5.
On 4-connected graphs without even cycle decompositions
Rizzi, Romeo
2002-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
tec50.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
526.9 kB
Formato
Adobe PDF
|
526.9 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
