Separating the edges of a graph by a linear number of paths.

Marthe Bonamy Fábio Botler François Dross Tássio Naia Jozef Skokan

Published in: CoRR (2023)

Keyphrases

undirected graph
directed graph
computational complexity
small number
weighted graph
random graphs
probabilistic model
shortest path
bipartite graph
directed edges
graph structure
directed acyclic graph
finite number
graph model
spanning tree
graph theoretic