Showing 2017 · math.COShow all
2 papers · 2 filters
math.CO2017
Revisiting the Hamiltonian Theme in the Square of a Block: The Case of DT-Graphs
Gek L. Chia, Jan Ekstein, Herbert Fleischner
The square of a graph G, denoted G^2, is the graph obtained from G by joining by an edge any two nonadjacent vertices which have a common neighbor. A graph G is said to have the F_…
math.CO2017
Cycle Double Covers via Kotzig Graphs
Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof
We show that every -connected cubic graph has a cycle double cover if has a spanning subgraph such that (i) every component of has an even number of vertices (ii…