The k-in-a-tree problem for chordal graphs

DOI10.21711/231766362015/RMC4410MaRDI QIDQ6489445FDOQ6489445

Authors: Vinícius F. dos Santos, Murilo V. G. da Silva, Jayme L. Szwarcfiter 

Publication date: 22 April 2024

Published in: Matemática Contemporânea (Search for Journal in Brave)

Recommendations

• The \(k\)-in-a-tree problem for graphs of girth at least \(k\)
• The four-in-a-tree problem in triangle-free graphs
• The three-in-a-tree problem
• The \(k\)-in-a-path problem for claw-free graphs
• The \(k\)-in-a-path problem for claw-free graphs

zbMATH Keywords

chordal graphsinduced subgraphs\(k\)-in-a-treethree-in-a-tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: The \(k\)-in-a-tree problem for chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489445)