Neighborhood unions and cyclability of graphs

DOI10.1016/j.dam.2003.05.002zbMath1064.05096OpenAlexW2132574144MaRDI QIDQ1827838

Mei Lu, Huiqing Liu, FengFeng Tian

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.dam.2003.05.002

zbMATH Keywords

Hamiltonian cycleDigraphCyclable graphPushed operation

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A fan-type condition for cyclability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs that can be oriented as diagrams of ordered sets
• On reorienting graphs by pushing down maximal vertices
• Neighbourhood unions and Hamiltonian properties in graphs
• Note on Hamilton Circuits
• Hamiltonicity and reversing arcs in digraphs
• Cycles through particular subgraphs of claw‐free graphs
• One sufficient condition for hamiltonian graphs
• An Ore-type condition for cyclability

This page was built for publication: Neighborhood unions and cyclability of graphs