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

DOI10.37236/11277OpenAlexW4323670415MaRDI QIDQ2692169

James A. jun. Long, Andrea Munaro, Kevin G. Milans

Publication date: 21 March 2023

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

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

zbMATH Keywords

longest path transversalconnected \(H\)-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Detour trees
• The price of connectivity for feedback vertex set
• Nonempty intersection of longest paths in series-parallel graphs
• The price of connectivity for cycle transversals
• Characterizing forbidden pairs for hamiltonian properties
• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• Nonempty intersection of longest paths in graphs without forbidden pairs
• Closing complexity gaps for coloring problems on \(H\)-free graphs
• Boundary classes for graph problems involving non-local properties
• Hamiltonicity in connected regular graphs
• A note on longest paths in circular arc graphs
• A note on Hamiltonian circuits
• A two-connected planar graph without concurrent longest paths
• Vertices missed by longest paths or circuits
• Nonempty intersection of longest paths in a graph with a small matching number
• Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity
• On longest paths and circuits in graphs.
• Longest Paths in Circular Arc Graphs
• Transversals of Longest Paths and Cycles
• Sublinear Longest Path Transversals
• Intersecting longest paths and longest cycles: A survey
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Intersection of longest paths in graph classes
• Transversals of longest paths

This page was built for publication: Non-empty intersection of longest paths in \(H\)-free graphs