| Title: | On the leaves of graph search trees |
|---|
| Authors: | ID Scheffler, Robert (Author) |
|---|
| Files: |  RAZ_Scheffler_Robert_2026.pdf (515,71 KB)
MD5: 209670D7F9F983E452451BCE3618E32F
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | graph search, graph search trees, leaves, chordal graphs |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 30.11.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 29 str. |
|---|
| Numbering: | Vol. 26, no. 1, [article no.] P1.08 |
|---|
| PID: | 20.500.12556/RUP-22292  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | 10.26493/1855-3974.3238.2a8 |
|---|
| Publication date in RUP: | 21.12.2025 |
|---|
| Views: | 193 |
|---|
| Downloads: | 1 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
