Rainbow spanning trees in randomly coloured G_k-out

10/04/2022

∙

Given a graph G=(V,E) on n vertices and an assignment of colours to its edges, a set of edges S ⊆ E is said to be rainbow if edges from S have pairwise different colours assigned to them. In this paper, we investigate rainbow spanning trees in randomly coloured random G_k-out graphs.

READ FULL TEXT

Rainbow spanning trees in randomly coloured G_k-out

Compression with wildcards: All spanning trees

Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings

On The Sitting Closer to Friends than Enemies Problem in Trees and An Intersection Model for Strongly Chordal Graphs

Splitting EUD graphs into trees: A quick and clatty approach

On the Simultaneous Minimum Spanning Trees Problem

Sparsification of the regularized magnetic Laplacian with multi-type spanning forests

Improving the Projection of Global Structures in Data through Spanning Trees

Rainbow spanning trees in randomly coloured G_k-out

Related Research

Compression with wildcards: All spanning trees

Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings

On The Sitting Closer to Friends than Enemies Problem in Trees and An Intersection Model for Strongly Chordal Graphs

Splitting EUD graphs into trees: A quick and clatty approach

On the Simultaneous Minimum Spanning Trees Problem

Sparsification of the regularized magnetic Laplacian with multi-type spanning forests

Improving the Projection of Global Structures in Data through Spanning Trees