3 papers
math.CO2026
On Hypergraph Colorings and Completely Independent Spanning Trees in Chordal Graphs
Mohammed Lalou, Nader Mbarek, Abdallah Skender +1
In this paper, we study the existence problem of completely independent spanning trees (CIST) in chordal graphs through appropriate hypergraph representations and their panchromati…
math.CO2026
Constructing two completely independent spanning trees in dual-cubes
Mohammed Lalou, Nader Mbarek, Abdallah Skender +1
In this paper, we prove the existence of two completely independent spanning trees in the -dimensional dual-cube , a variant of the hypercube, for every . To this…
math.CO2025
Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
Mohammed Lalou, Nader Mbarek, Abdallah Skender +1
We study completely independent spanning trees (CIST), \textit{i.e.}, trees that are both edge-disjoint and internally vertex-disjoint, in split graphs. We establish a corresponden…