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

DOI10.1016/J.DISC.2010.05.005zbMATH Open1230.05180OpenAlexW2154584512MaRDI QIDQ708377FDOQ708377

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

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

zbMATH Keywords

degree sumcyclable\(k\)-ordered

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

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

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)