8 papers · 1 filter
Constructing two completely independent spanning trees in the dual-cube
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…
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…
On List Coloring with Separation of the Complete Graph and Set System Intersections
Jean-Christophe Godin, Rémi Grisot, Olivier Togni
We consider the following list coloring with separation problem: Given a graph and integers , find the largest integer such that for any list assignment of wit…
Choosability with Separation of Cycles and Outerplanar Graphs
Jean-Christophe Godin, Olivier Togni
We consider the following list coloring with separation problem of graphs: Given a graph and integers , find the largest integer such that for any list assignment …
Exact distance graphs of product graphs
Boštjan Brešar, Nicolas Gastineau, Sandi Klavžar +1
Given a graph , the exact distance- graph has as its vertex set, and two vertices are adjacent whenever the distance between them in equals .…
Packing colorings of subcubic outerplanar graphs
Boštjan Brešar, Nicolas Gastineau, Olivier Togni
Given a graph and a nondecreasing sequence of positive integers, the mapping is called an -packing coloring of $G…