Survey of results on \(k\)-ordered graphs
From MaRDI portal
Publication:5931446
DOI10.1016/S0012-365X(00)00202-8zbMath0967.05041WikidataQ105709462 ScholiaQ105709462MaRDI QIDQ5931446
Publication date: 27 August 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (20)
Linkage for the diamond and the path with four vertices ⋮ Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ Subdivision extendibility ⋮ Cyclability, connectivity and circumference ⋮ On low degree \(k\)-ordered graphs ⋮ Solution to an open problem on 4-ordered Hamiltonian graphs ⋮ On 4-ordered 3-regular graphs ⋮ Pairs of edges as chords and as cut-edges ⋮ Graph powers and \(k\)-ordered hamiltonicity ⋮ Generalizing vertex pancyclic and \(k\)-ordered graphs ⋮ On 3-regular 4-ordered graphs ⋮ Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian ⋮ 4-connected triangulations and 4-orderedness ⋮ Set-orderedness as a generalization of \(k\)-orderedness and cyclability ⋮ 7-connected graphs are 4-ordered ⋮ \(k\)-ordered hamiltonicity of iterated line graphs ⋮ A fan-type result on \(k\)-ordered graphs ⋮ On \(k\)-edge-ordered graphs ⋮ Connectivity for Kite-Linked Graphs
This page was built for publication: Survey of results on \(k\)-ordered graphs
