Vertex-transitive graphs that have no Hamilton decomposition.
Darryn E. BryantMatthew DeanPublished in: J. Comb. Theory, Ser. B (2015)
Keyphrases
- directed graph
- undirected graph
- attributed graphs
- labeled graphs
- hamiltonian cycle
- connected subgraphs
- maximum cardinality
- graph matching
- average degree
- structural learning
- decomposition method
- vertex set
- neural network
- hierarchical decomposition
- decomposition algorithm
- graph clustering
- transitive closure
- graph theory
- bipartite graph
- xml documents
- social networks
- graph data
- edge weights
- minimum weight
- graph model
- weighted graph
- random walk
- data sets