A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs.
Richard C. BrewsterArnott KidnerGary MacGillivrayPublished in: CoRR (2023)
Keyphrases
- weighted graph
- undirected graph
- edge detection
- graph theoretic
- minimum spanning trees
- edge detector
- graph theory
- series parallel
- graph clustering
- graph representation
- spanning tree
- vertex set
- subgraph isomorphism
- graph partitioning
- edge information
- multiscale
- neural network
- graph databases
- complex structures
- edge map
- graph mining
- graph structure
- edge weights
- minimum spanning tree
- shortest path
- graph structures
- random walk
- object recognition
- search engine