On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
From MaRDI portal
Publication:6057351
DOI10.1007/978-3-031-30448-4_25OpenAlexW4366958280MaRDI QIDQ6057351
Frances A. Rosamond, Petr A. Golovach, Emmanuel Sam, Michael R. Fellows
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30448-4_25
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Spanning trees: A survey
- Trémaux trees and planarity
- Elements of finite model theory.
- A characterization of planar graphs by Trémaux orders
- On finding optimal and near-optimal lineal spanning trees
- Linear time solvable optimization problems on graphs of bounded clique-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Graph Theory
- Normal Spanning Trees, Aronszajn Trees and Excluded Minors
- Crossing Number is NP-Complete
- The bandwidth problem for graphs and matrices—a survey
- On Linear Time Minor Tests with Depth-First Search
- Efficient Planarity Testing
- Network Flow and Testing Graph Connectivity
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Collaborating with Hans: Some Remaining Wonderments
- Trémaux Trees and Planarity
- Mathematical Foundations of Computer Science 2003
- TRÉMAUX TREES AND PLANARITY
- Parameterized Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Algorithms and Data Structures
This page was built for publication: On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
