Hamiltonian connectedness and a matching in powers of connected graphs

DOI10.21136/MB.1995.126003zbMATH Open0848.05047OpenAlexW2730303313MaRDI QIDQ4876277

Elena Wisztová

Publication date: 6 October 1996

Full work available at URL: https://eudml.org/doc/231629

zbMATH Keywords

matchingdistancepowerhamiltonian connectedhamiltonian path

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Title not available (Why is that?) ⋮ Graph powers and \(k\)-ordered hamiltonicity

This page was built for publication: Hamiltonian connectedness and a matching in powers of connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876277)