Heavy subgraph conditions for longest cycles to be heavy in graphs

DOI10.7151/DMGT.1863zbMath1338.05151arXiv1109.4675OpenAlexW1506263977MaRDI QIDQ274691

Binlong Lia, Sheng Gui Zhang

Publication date: 25 April 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4675

zbMATH Keywords

heavy cyclesheavy subgraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (2)

A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph ⋮ Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs

Cites Work

• Unnamed Item
• Cycles through specified vertices
• New sufficient conditions for cycles in graphs
• 2‐neighborhoods and hamiltonian conditions

This page was built for publication: Heavy subgraph conditions for longest cycles to be heavy in graphs