Nonempty intersection of longest paths in graphs without forbidden pairs

DOI10.1016/j.dam.2021.07.029zbMath1473.05147arXiv1907.13074OpenAlexW3184354892MaRDI QIDQ2231747

Songling Shan, Yu-ping Gao

Publication date: 30 September 2021

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

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

zbMATH Keywords

Hamiltonian cyclelongest pathforbidden pairs

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Non-empty intersection of longest paths in \(H\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonempty intersection of longest paths in series-parallel graphs
• Claw-free and \(N(2,1,0)\)-free graphs are almost net-free
• Characterizing forbidden pairs for hamiltonian properties
• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• Nonempty intersection of longest paths in a graph with a small matching number
• On longest paths and circuits in graphs.
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Intersection of longest paths in graph classes

This page was built for publication: Nonempty intersection of longest paths in graphs without forbidden pairs