Long dominating cycles and paths in graphs with large neighborhood unions

DOI10.1002/jgt.3190150106zbMath0729.05032OpenAlexW2026579544MaRDI QIDQ3353048

Hajo J. Broersma, Henk Jan Veldman

Publication date: 1991

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/long-dominating-cycles-and-paths-in-graphs-with-large-neighborhood-unions(cac22e4b-bc99-4389-8984-8da9b3d769a7).html

zbMATH Keywords

Hamilton pathHamilton cycledominating cycleOre's Theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items (5)

Lower bounds of length of longest cycles in graphs involving neighborhood unions ⋮ Long dominating cycles in graphs ⋮ Hamiltonian properties of graphs with large neighborhood unions ⋮ Perfect matching dominating cycle — a new dominating cycle ⋮ A generalization of Ore's Theorem involving neighborhood unions

Cites Work

• Unnamed Item

This page was built for publication: Long dominating cycles and paths in graphs with large neighborhood unions