[PDF][PDF] A review of the hierarchy of plithogenic, neutrosophic, and fuzzy graphs: Survey and applications

T Fujita, F Smarandache - ResearchGate, 2024 - researchgate.net
As many readers may know, graph theory is a fundamental branch of mathematics that
examines networks consisting of nodes and edges, with a focus on their paths, structures …

[BOOK][B] Parameterized algorithms

M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx… - 2015 - Springer
The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

[BOOK][B] Graph structure and monadic second-order logic: a language-theoretic approach

B Courcelle, J Engelfriet - 2012 - books.google.com
The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …

[PDF][PDF] Survey of trees, forests, and paths in fuzzy and neutrosophic graphs

T Fujita - 2024 - philarchive.org
In this paper, we conduct a comprehensive study of Trees, Forests, and Paths within the
framework of Fuzzy and Neutrosophic Graphs. Graph theory, known for its wide-ranging …

[PDF][PDF] Fuzzy directed tree-width and fuzzy hypertree-width

T Fujita - ResearchGate, 2024 - researchgate.net
Graph characteristics are frequently examined using a variety of parameters, with ongoing
research focused on exploring these aspects. A fuzzy graph is a mathematical model in …

Obstruction for hypertree width and superhypertree width

T Fujita - … and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough …, 2025 - books.google.com
Graph characteristics are frequently studied using various parameters, with ongoing
research aimed at uncovering deeper insights into these aspects. A hypergraph, which …

Twin-width VI: the lens of contraction sequences∗

É Bonnet, EJ Kim, A Reinald, S Thomassé - … of the 2022 Annual ACM-SIAM …, 2022 - SIAM
A contraction sequence of a graph consists of iteratively merging two of its vertices until only
one vertex remains. The recently introduced twin-width graph invariant is based on …

Deciding twin-width at most 4 is NP-complete

P Bergé, É Bonnet, H Déprés - ar** such that whenever. The
Coloring problem is to decide, for a given G and k, whether ak‐coloring of G exists. If k is …