Dominating cycles and forbidden pairs containing \(P_5\)

DOI10.1007/S00373-015-1673-8zbMath1351.05124arXiv1502.02933OpenAlexW2255270643MaRDI QIDQ343722

Shoichi Tsuchiya, Shuya Chiba, Michitaka Furuya

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

forbidden subgraphsforbidden pairsdominating cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Characterizing forbidden pairs for relative length of longest paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paw-free graphs
• Forbidden subgraphs and Hamiltonian properties and graphs
• Characterizing forbidden pairs for hamiltonian properties
• Forbidden pairs and the existence of a dominating cycle

This page was built for publication: Dominating cycles and forbidden pairs containing \(P_5\)