Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles.
Peter AllenJulia BöttcherRichard LangJozef SkokanMaya SteinPublished in: Eur. J. Comb. (2024)
Keyphrases
- weighted graph
- minimum cut
- vertex set
- graph partitioning
- undirected graph
- spanning tree
- partitioning algorithm
- maximum flow
- edge weights
- random graphs
- min cut
- normalized cut
- minimum cost
- edge disjoint
- spectral graph
- graph model
- graph structure
- graph theory
- disjoint paths
- graph theoretic
- directed graph
- edge detection
- structured data
- edge information
- graph representation
- minimum spanning tree
- social networks
- lower bound
- degree distribution
- random walk
- connected components
- graph search
- graph matching
- graph mining