Cycles through given vertices and closures

DOI10.1016/S0012-365X(03)00304-2zbMath1031.05072MaRDI QIDQ1422413

Evelyne Flandrin, Zdeněk Ryjáček, Hao Li, Roman Čada

Publication date: 14 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

ClosureClawCyclabilityDegree conditionPancyclability

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs ⋮ A \(k\)-tree containing specified vertices ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ A note on degree conditions for traceability in locally claw-free graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Degree conditions and degree bounded trees ⋮ A look at cycles containing specified elements of a graph

Cites Work

• Unnamed Item
• A method in graph theory
• An Ore-type condition for pancyclability
• A degree characterisation of pancyclicity
• On a closure concept in claw-free graphs
• Closure concepts for claw-free graphs
• Cycles through prescribed vertices with large degree sum
• Closure concepts: A survey
• A note on Hamiltonian circuits
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• 2‐neighborhoods and hamiltonian conditions
• Closure and stable Hamiltonian properties in claw-free graphs
• On the stability for pancyclicity
• Cycles through particular subgraphs of claw‐free graphs
• Sequences, claws and cyclability of graphs

This page was built for publication: Cycles through given vertices and closures