On cycles that alternate through selected sets of vertices

DOI10.1007/S00373-020-02190-9MaRDI QIDQ2227991zbMATH OpenOpenAlexFDO

Authors Colton Magnant, Yaping Mao

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-02190-9

zbMATH Keywords

cyclesHamiltonian cyclesordering vertices on cycles

Mathematics Subject Classification ID

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

Recommendations

• Locating sets of vertices on Hamiltonian cycles
• Alternating hamiltonian cycles in two colored complete bipartite graphs
• Alternating Hamiltonian cycles
• Precise location of vertices on Hamiltonian cycles
• M-alternating Hamilton paths and M-alternating Hamilton cycles

Cites work

• Graphs \& digraphs
• scientific article; zbMATH DE number 5036076 (Why is no real title available?)
• k-ordered Hamiltonian graphs
• Locating sets of vertices on Hamiltonian cycles
• Panconnected graphs. II

Cited in

(3)

• Cycles through given vertices and closures
• Long cycles through specified vertices
• Locating sets of vertices on Hamiltonian cycles

This page was built for publication: On cycles that alternate through selected sets of vertices

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