Five‐cycle double cover and shortest cycle cover

The 5‐even subgraph cycle double cover conjecture (5‐CDC conjecture) asserts that every bridgeless graph has a 5‐even subgraph double cover. A shortest even subgraph cover of a graph G is a family of even subgraphs which cover all the edges of G and the sum of their lengths is minimum. It is conject...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2025-01, Vol.108 (1), p.39-49
Hauptverfasser:	Liu, Siyan, Hao, Rong‐Xia, Luo, Rong, Zhang, Cun‐Quan
Format:	Artikel
Sprache:	eng
Schlagworte:	4‐even subgraph cover 4‐flow Apexes Graph theory Graphs oddness shortest even subgraph cover
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!