Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree.
József BaloghAlexandr V. KostochkaMikhail LavrovXujun LiuPublished in: Comb. Probab. Comput. (2022)
Keyphrases
- weighted graph
- disjoint paths
- undirected graph
- random graphs
- spanning tree
- shortest path
- directed graph
- minimum spanning trees
- minimum cost
- graph model
- graph theory
- graph partitioning
- graph matching
- edge detection
- square error
- connected dominating set
- neural network
- vertex set
- graph clustering
- edge weights
- graph theoretic
- search algorithm
- data sets
- graph databases
- optimal path
- path length
- edge information
- graph structure
- edge detector
- knn
- social networks