Unavoidable vertex-minors in large prime graphs.
O-joung KwonSang-il OumPublished in: Eur. J. Comb. (2014)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- hamiltonian cycle
- connected subgraphs
- random graphs
- graph theory
- graph matching
- graph structure
- graph model
- subgraph isomorphism
- average degree
- case study
- graph theoretic
- real time
- graph construction
- minimum weight
- structured objects
- vertex set
- maximum cardinality
- strongly connected
- series parallel
- graph data
- edge weights
- graph mining
- bipartite graph
- data mining