2017•Discrete Applied MathematicsOpen access

Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees

Benoît Darties, Nicolas Gastineau, Olivier Togni

Open full text 8 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Spanning tree, Combinatorics, Mathematics, Disjoint sets, Trémaux tree, Minimum spanning tree, Minimum degree spanning tree, Discrete mathematics

Back to paper search Browse research topics Original source

Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees — Research Paper | ScholarLens