Minimum degree conditions for cycles including specified sets of vertices

DOI10.1007/S00373-004-0565-0zbMATH Open1053.05071OpenAlexW1993242964MaRDI QIDQ704845FDOQ704845

Authors: Wayne Goddard 

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0565-0

Recommendations

• Generalizing pancyclic and \(k\)-ordered graphs
• Generalizing vertex pancyclic and \(k\)-ordered graphs
• Minimal degree and \((k,m)\)-pancyclic ordered graphs
• Cycles through specified vertices
• Vertex pancyclic graphs

zbMATH Keywords

cycle\(k\)-ordered-pancyclicset-pancyclic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cited In (10)

• Minimal degree and \((k,m)\)-pancyclic ordered graphs
• Minimum degree condition for a graph to be knitted
• Recent advances on the Hamiltonian problem: survey III
• Set-orderedness as a generalization of \(k\)-orderedness and cyclability
• A degree condition for cycles passing through specified vertices and edges
• A look at cycles containing specified elements of a graph
• Bi-cycle extendable through a given set in balanced bipartite graphs
• Generalizing pancyclic and \(k\)-ordered graphs
• Generalizing vertex pancyclic and \(k\)-ordered graphs
• Title not available (Why is that?)

This page was built for publication: Minimum degree conditions for cycles including specified sets of vertices

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