Set-orderedness as a generalization of \(k\)-orderedness and cyclability

DOI10.1016/J.DISC.2010.05.005zbMath1230.05180OpenAlexW2154584512MaRDI QIDQ708377

Kiyoshi Yoshimoto, Keishi Ishii, Kenta Ozeki

Publication date: 11 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.05.005

zbMATH Keywords

degree sumcyclable\(k\)-ordered

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Disjoint cycles in hypercubes with prescribed vertices in each cycle

Cites Work

• Unnamed Item
• Cycles through specified vertices
• Minimum degree conditions for cycles including specified sets of vertices
• Cycles through subsets with large degree sums
• On \(k\)-ordered bipartite graphs
• On \(k\)-ordered graphs involved degree sum
• Cycles through prescribed vertices with large degree sum
• Long cycles containing \(k\)-ordered vertices in graphs
• 2‐neighborhoods and hamiltonian conditions
• Onk-ordered Hamiltonian graphs
• Cyclability of 3-connected graphs
• Degree conditions for k‐ordered hamiltonian graphs
• k-ordered Hamiltonian graphs
• Survey of results on \(k\)-ordered graphs
• Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian

This page was built for publication: Set-orderedness as a generalization of \(k\)-orderedness and cyclability