Branch-depth: Generalizing tree-depth of graphs
Authors:
- Matt DeVosMDMatt DeVos
- O-Joung KwonOKO-Joung Kwon
- Sang-Il OumSOSang-Il Oum
Open Access
- 1 December 2020
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 90
Abstract
No abstract availableAll Related Versions
Funding Information
- Institute for Basic Science (IBS-R029-C1)
- Ministère de l'Éducation, Gouvernement de l'Ontario (NRF-2018R1D1A1B07050294)
- Natural Sciences and Engineering Research Council of Canada
- National Research Foundation of Korea
This publication has 24 references indexed in Scilit:
- Asymptotically optimal induced universal graphsGeometric and Functional Analysis, 2017
- Large ‐ or ‐Minors in 3‐Connected GraphsJournal of Graph Theory, 2015
- Unavoidable minors of graphs of large typeDiscrete Mathematics, 2002
- Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-WidthTheory of Computing Systems, 2000
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- On tree-partitions of graphsDiscrete Mathematics, 1996
- On Infinite Antichains of MatroidsJournal of Combinatorial Theory, Series B, 1995
- Subgraphs and well‐quasi‐orderingJournal of Graph Theory, 1992
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952