On the thinness of trees
From MaRDI portal
Publication:6166903
DOI10.1007/978-3-031-18530-4_14zbMATH Open1528.90205OpenAlexW4312742781MaRDI QIDQ6166903FDOQ6166903
Authors: Flavia Bonomo, Eric Brandwein, Carolina Lucía Gonzalez, Agustín Sansone
Publication date: 3 August 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-18530-4_14
Recommendations
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Parameterized algorithms
- The complexity of comparability graph recognition and coloring
- The vertex separation and search number of a graph
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- The stable set problem and the thinness of a graph
- Linear MIM-width of trees
- On the thinness and proper thinness of a graph
- Solving problems on generalized convex graphs via mim-width
- Twin-width. I: Tractable FO model checking
- Column subset selection is NP-complete
- Twin-width and transductions of proper \(k\)-mixed-thin graphs
Cited In (5)
This page was built for publication: On the thinness of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166903)