4 papers
A Best Possible Result for the Square of a 2-Block to be Hamiltonian
Jan Ekstein, Herbert Fleischner
It is shown that for any choice of four different vertices x_1,...,x_4 in a 2-block G of order p>3, there is a hamiltonian cycle in G^2 containing four different edges x_iy_i of E(…
Perfect Pseudo-Matchings in cubic graphs
Herbert Fleischner, Behrooz Bagheri Gh., Benedikt Klocker
A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3. In view of snarks G with dominating cycl…
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_…
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…