BOUNDING LINEAR-WIDTH AND DISTANCE-WIDTH USING FEEDBACK VERTEX SET AND MM-WIDTH FOR GRAPH

Abstract

Studying the upper and lower bounds of graph parameters is crucial for understanding the complexity and tractability of computational problems, optimizing algorithms, and revealing structural properties of various graph classes. In this brief paper, we explore the upper and lower bounds of graph parameters, including path-distance-width, MM-Width, Feedback Vertex Set, and linear-width. These bounds are crucial for understanding the complexity and structure of graphs