On graph closures

DOI10.1016/S0012-365X(02)00573-3zbMath1021.05059OpenAlexW2028806435MaRDI QIDQ1408872

Alexander K. Kelmans

Publication date: 25 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00573-3

zbMATH Keywords

claw-free graphHamiltonian cyclecircumferenceHamiltonian pathclosure

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Adjacency polynomials of digraph transformations ⋮ Spectra of digraph transformations ⋮ On Hamiltonicity of \{claw, net\}-free graphs ⋮ Laplacian spectra of digraph transformations ⋮ Closure concept for 2-factors in claw-free graphs ⋮ Closure operation for even factors on claw-free graphs ⋮ 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected ⋮ On stability of Hamilton-connectedness under the 2-closure in claw-free graphs ⋮ Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs

This page was built for publication: On graph closures