Long induced paths in graphs

DOI10.1016/j.ejc.2016.11.011zbMath1358.05148arXiv1602.06836OpenAlexW2281501900MaRDI QIDQ518170

Laetitia Lemoine, Louis Esperet, Frédéric Maffray

Publication date: 28 March 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

interval graphs3-connected planar graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items

Long induced paths in minor-closed graph classes and beyond, Sparse graphs without long induced paths, On exact solution approaches for the longest induced path problem

Cites Work

• Unnamed Item
• Lower and upper bounds for long induced paths in 3-connected planar graphs
• Sparsity. Graphs, structures, and algorithms
• Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
• Long induced paths in 3-connected planar graphs