The second volume of “Advancing Uncertain Combinatorics through Graphization,
Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” …

A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier
papers of this series we proved that every claw-free graph either belongs to one of several …

This study introduces and explores new concepts of Turiyam Neutrosophic Soft Graphs and
General Plithogenic Soft Graphs. It examines models of uncertain graphs, including Fuzzy …

A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In this series of
papers we give a structural description of all claw-free graphs. In this paper, we achieve a …

This thesis concerns the relationship between four graph invariants: ω, χf, χ, and∆. These are
the clique number, the fractional chromatic number, the chromatic number, and the …

The union-closed sets conjecture asserts that in a finite non-trivial union-closed family of
sets there has to be an element that belongs to at least half the sets. We show that this is …

In 1982 Truemper gave a theorem that characterizes graphs whose edges can be labeled
so that all chordless cycles have prescribed parities. The characterization states that this can …

Given a graph G and an integer k, the H-free Edge Editing problem is to find whether there
exist at most k pairs of vertices in G such that changing the adjacency of the pairs in G …

We present the first polynomial-time algorithm to solve the maximum weight independent set
problem for apple-free graphs, which is a common generalization of several important …

A graph G is a quasi‐line graph if for every vertex v, the set of neighbors of v can be
expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of …