On symmetries of edge and vertex colourings of graphs.
Florian LehnerSimon M. SmithPublished in: Discret. Math. (2020)
Keyphrases
- undirected graph
- edge weights
- vertex set
- directed graph
- weighted graph
- attributed graphs
- labeled graphs
- graph structure
- strongly connected
- connected components
- complex networks
- approximation algorithms
- directed acyclic graph
- edge detection
- graph theoretic
- minimum weight
- spanning tree
- bipartite graph
- graph matching
- random graphs
- edge information
- hamiltonian cycle
- connected subgraphs
- graph partitioning
- graph clustering
- minimum cost
- average degree
- minimum spanning trees
- maximum cardinality
- symmetry breaking
- subgraph isomorphism