The Four-in-a-Tree Problem in Triangle-Free Graphs

Authors:

Publisher website

1 November 2009

journal article
research article
Published by Springer Nature in Graphs and Combinatorics

Vol. 25 (4) , 489-502
DOI:10.1007/s00373-009-0867-3

Abstract

No abstract available

Keywords

All Related Versions

This publication has 3 references indexed in Scilit:

Finding induced trees
Discrete Applied Mathematics, 2009
Detecting induced subgraphs
Electronic Notes in Discrete Mathematics, 2007
On the complexity of testing for odd holes and induced odd paths
Discrete Mathematics, 1991