On the thinness of trees

DOI10.1016/J.DAM.2024.12.027MaRDI QIDQ7025852zbMATH OpenFDO

Authors Flavia Bonomo, Eric Brandwein, Carolina Lucía Gonzalez, Agustín Sansone

Publication date 19 February 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.12.027

zbMATH Keywords

polynomial time algorithmthinnesstrees

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• A new property of critical imperfect graphs and some consequences
• A sign pattern with all diagonal entries nonzero whose minimal rank realizations are not diagonalizable over \(\mathbb{C}\)
• A unified approach to domination problems on interval graphs
• An optimal greedy heuristic to color interval graphs
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Linear MIM-width of trees
• On the thinness and proper thinness of a graph
• On the thinness of trees
• Parameterized algorithms
• Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
• Solving problems on generalized convex graphs via mim-width
• The complexity of comparability graph recognition and coloring
• The point-set embeddability problem for plane graphs
• The stable set problem and the thinness of a graph
• The vertex separation and search number of a graph
• Twin-width and transductions of proper \(k\)-mixed-thin graphs
• Twin-width. I: Tractable FO model checking

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 Q7025852)