# Graph Search Trees and Their Leaves

Graph searches and their respective search trees are widely used in algorithmic graph theory. The problem whether a given spanning tree can be a graph search tree has been considered for different searches, graph classes and search tree paradigms. Similarly, the question whether a particular vertex can be visited last by some search has been studied extensively in recent years. We combine these two problems by considering the question whether a vertex can be a leaf of a graph search tree. We show that for particular search trees, including DFS trees, this problem is easy if we allow the leaf to be the first vertex of the search ordering. We contrast this result by showing that the problem becomes hard for many searches, including DFS and BFS, if we forbid the leaf to be the first vertex. Additionally, we present several structural and algorithmic results for search tree leaves of chordal graphs.

research
11/22/2018

### Recognizing Graph Search Trees

Graph searches and the corresponding search trees can exhibit important ...
research
08/31/2021

### Graphs where Search Methods are Indistinguishable

Graph searching is one of the simplest and most widely used tools in gra...
research
06/29/2022

### Linearizing Partial Search Orders

In recent years, questions about the construction of special orderings o...
research
03/30/2018

### On the Diameter of Tree Associahedra

We consider a natural notion of search trees on graphs, which we show is...
research
07/01/2023

### Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves

For a given graph G, a depth-first search (DFS) tree T of G is an r-root...
research
01/29/2023

### Multi-Priority Graph Sparsification

A sparsification of a given graph G is a sparser graph (typically a subg...
research
05/25/2023

### Sidorenko-Type Inequalities for Pairs of Trees

Given two non-empty graphs H and T, write H≽ T to mean that t(H,G)^|E(T)...