Large families of mutually embeddable vertex-transitive graphs.
Anthony BonatoClaude TardifPublished in: J. Graph Theory (2003)
Keyphrases
- satisfiability problem
- phase transition
- hamiltonian cycle
- np complete
- directed graph
- average degree
- search algorithm
- undirected graph
- labeled graphs
- attributed graphs
- maximum cardinality
- minimum weight
- transitive closure
- bipartite graph
- graph model
- edge weights
- graph matching
- vertex set
- spanning tree
- graph theoretic
- connected subgraphs
- subgraph isomorphism
- graph structure
- graph representation
- graph construction
- bayesian networks
- graph theory
- weighted graph
- graph data
- complex structures