Forbidden subgraphs for a graph to have a Hamiltonian path square
From MaRDI portal
Publication:2227983
DOI10.1007/S00373-020-02186-5zbMATH Open1458.05135OpenAlexW3034116914MaRDI QIDQ2227983FDOQ2227983
Authors: Xiaojing Yang, Liming Xiong
Publication date: 16 February 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02186-5
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Graph theory
- Hamiltonicity in claw-free graphs
- The square of paths and cycles
- Hamiltonian square-paths
- The Square of a Hamiltonian Cycle
- Proof techniques for factor theorems
- Characterizing forbidden pairs for Hamiltonian squares
- Characterizing the difference between graph classes defined by forbidden pairs including the claw
Cited In (4)
This page was built for publication: Forbidden subgraphs for a graph to have a Hamiltonian path square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227983)