On the length of longest dominating cycles in graphs

DOI10.1016/0012-365X(93)90554-7zbMath0783.05066MaRDI QIDQ1309474

Vũ Đình Hòa

Publication date: 24 January 1994

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

zbMATH Keywords

boundslongest cycledominating cycle1-tough cycle-dominable graph

Mathematics Subject Classification ID

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

Related Items (1)

Toughness in graphs -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long cycles in graphs with large degree sums
• A generalization of a result of Häggkvist and Nicoghossian
• Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
• Tough graphs and Hamiltonian circuits.
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• Ein Struktursatz für 2-fach zusammenhängende Graphen mit großer Minimalvalenz

This page was built for publication: On the length of longest dominating cycles in graphs