Set-orderedness as a generalization of \(k\)-orderedness and cyclability
type: Item
instance of: scholarly article
title: Set-orderedness as a generalization of \(k\)-orderedness and cyclability
zbMATH Open document ID: 1230.05180
author: Keishi Ishii
author: Kenta Ozeki
author: Kiyoshi Yoshimoto
published in: Discrete Mathematics
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5798524
zbMATH Keywords: \(k\)-ordered
zbMATH Keywords: cyclable
zbMATH Keywords: degree sum
MaRDI profile type: Publication
full work available at URL: j.disc.2010.05.005
OpenAlex ID: W2154584512
cites work: Cycles through specified vertices
cites work: Q4871748
cites work: Cycles through subsets with large degree sums
cites work: Survey of results on \(k\)-ordered graphs
cites work: Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian
cites work: Degree conditions for k‐ordered hamiltonian graphs
cites work: On \(k\)-ordered bipartite graphs
cites work: Minimum degree conditions for cycles including specified sets of vertices
cites work: Cyclability of 3-connected graphs
cites work: On \(k\)-ordered graphs involved degree sum
cites work: Onk-ordered Hamiltonian graphs
cites work: k-ordered Hamiltonian graphs
cites work: Long cycles containing \(k\)-ordered vertices in graphs
cites work: Cycles through prescribed vertices with large degree sum
cites work: 2‐neighborhoods and hamiltonian conditions
DOI: 10.1016/J.DISC.2010.05.005
description: scientific article; zbMATH DE number 5798524