The \(k\)-in-a-tree problem for graphs of girth at least \(k\)

DOI10.1016/j.dam.2010.06.005zbMath1198.05142arXiv1309.1279OpenAlexW2059198909MaRDI QIDQ602681

Sumit K. Garg

Publication date: 5 November 2010

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

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

zbMATH Keywords

treealgorithmgirthinduced subgraph\(k\)-in-a-treethree-in-a-tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

MIP formulations for induced graph optimization problems: a tutorial ⋮ The \(k\)-in-a-path problem for claw-free graphs ⋮ FPT and kernelization algorithms for the induced tree problem ⋮ The (theta, wheel)-free graphs. IV: Induced paths and cycles ⋮ Induced Disjoint Paths in Claw-Free Graphs ⋮ Induced disjoint paths in AT-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The three-in-a-tree problem
• The four-in-a-tree problem in triangle-free graphs
• Detecting induced subgraphs

This page was built for publication: The \(k\)-in-a-tree problem for graphs of girth at least \(k\)