Set-orderedness as a generalization of k-orderedness and cyclability

DOI10.1016/J.DISC.2010.05.005MaRDI QIDQ708377zbMATH OpenOpenAlexFDO

Authors Keishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto

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)

Recommendations

• Onk-ordered graphs
• On \(k\)-edge-ordered graphs
• Long cycles containing k-ordered vertices in graphs
• Survey of results on \(k\)-ordered graphs
• k-ordered Hamiltonian graphs

Cites work

• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• 2‐neighborhoods and hamiltonian conditions
• Cyclability of 3-connected graphs
• Cycles through prescribed vertices with large degree sum
• Cycles through specified vertices
• Cycles through subsets with large degree sums
• Degree conditions for k‐ordered hamiltonian graphs
• Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian
• Long cycles containing k-ordered vertices in graphs
• Minimum degree conditions for cycles including specified sets of vertices
• On \(k\)-ordered bipartite graphs
• On \(k\)-ordered graphs involved degree sum
• Onk-ordered Hamiltonian graphs
• Survey of results on \(k\)-ordered graphs
• k-ordered Hamiltonian graphs

Cited in

(2)

• \(\kappa\)-embeddings of ordered sets
• Disjoint cycles in hypercubes with prescribed vertices in each cycle

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

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