The crossing numbers of products of a 5-vertex graph with paths and cycles.
Marián KlescPublished in: Discuss. Math. Graph Theory (1999)
Keyphrases
- directed graph
- undirected graph
- hamiltonian cycle
- minimum weight
- labeled graphs
- edge weights
- disjoint paths
- maximum cardinality
- graph theory
- path length
- shortest path
- weighted graph
- average degree
- vertex set
- bipartite graph
- spanning tree
- attributed graphs
- random graphs
- graph matching
- connected components
- graph representation
- graph structure
- graph clustering
- strongly connected
- graph partitioning
- link analysis
- graph databases
- structured data
- random walk
- web graph
- connected subgraphs