Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms.
Primoz PotocnikPublished in: J. Comb. Theory, Ser. B (2004)
Keyphrases
- undirected graph
- weighted graph
- vertex set
- directed graph
- edge weights
- special case
- minimum weight
- labeled graphs
- attributed graphs
- hamiltonian cycle
- spanning tree
- graph structure
- edge information
- maximum cardinality
- minimum spanning trees
- graph theoretic
- complex networks
- graph model
- data sets
- connected subgraphs
- np hard
- edge detection
- np complete
- strongly connected
- random graphs
- approximation algorithms
- bipartite graph
- graph theory
- graph clustering
- connected components
- graph kernels
- group members
- graph matching
- graphical models
- average degree
- pairwise
- minimum cost
- directed acyclic graph