Fujita, Takaaki
Unknown Affiliation

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

BOUNDED TREE-DEPTH, PATH-DISTANCE-WIDTH, AND LINEAR-WIDTH OF GRAPHS Fujita, Takaaki
Journal of Fundamental Mathematics and Applications (JFMA) Vol 7, No 2 (2024)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v7i2.24214

Abstract

The study of width parameters and related graph parameters is an activearea of research in graph theory. In this brief paper, we explore the upper and lowerbounds of graph parameters, including path-distance-width, tree-distance-width, tree-depth, and linear-width. These bounds are crucial for understanding the complexityand structure of graphs.
BOUNDING LINEAR-WIDTH AND DISTANCE-WIDTH USING FEEDBACK VERTEX SET AND MM-WIDTH FOR GRAPH Fujita, Takaaki
Journal of Fundamental Mathematics and Applications (JFMA) Vol 8, No 1 (2025)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v8i1.24222

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.