2017/01/20 by Herbert Fleischner, Roland Häggkvist, Fleischner, Herbert +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1701.05844
openalex publication_date 2017/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that every 2-connected cubic graph G has a cycle double cover if G has a spanning subgraph F such that (i) every component of F has an even number of vertices (ii) every component of F is either a cycle or a subdivision of a Kotzig graph and (iii) the components of F are connected to each other in a certain general manner.