Nonempty intersection of longest paths in \(2K_2\)-free graphs

zbMath1388.05099arXiv1611.05967MaRDI QIDQ1640209

Gili Golan, Songling Shan

Publication date: 14 June 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

longest paths\(2K_2\)-free graphsdominating paths

Mathematics Subject Classification ID

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

Related Items (8)

Well-partitioned chordal graphs ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Intersecting longest paths in chordal graphs ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Three problems on well-partitioned chordal graphs ⋮ Nonempty intersection of longest paths in graphs without forbidden pairs ⋮ Intersection of longest paths in graph classes ⋮ Transversals of longest paths

Cites Work

• Nonempty intersection of longest paths in series-parallel graphs
• Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Large regular graphs with no induced \(2K_ 2\)
• Planar and infinite hypohamiltonian and hypotraceable graphs
• A note on longest paths in circular arc graphs
• Longest Paths in Circular Arc Graphs
• Intersecting longest paths and longest cycles: A survey
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonempty intersection of longest paths in \(2K_2\)-free graphs