Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I.
Hans-Dietrich O. F. GronauPublished in: Discret. Math. (1981)
Keyphrases
- undirected graph
- weighted graph
- labeled graphs
- graph model
- adjacency matrix
- vertex set
- random graphs
- bipartite graph
- directed graph
- edge weights
- graph representation
- hamiltonian cycle
- graph theory
- attributed graphs
- directed edges
- graph partitioning
- graph theoretic
- maximal cliques
- planar graphs
- graph matching
- maximum cardinality
- minimum weight
- graph structure
- connected components
- betweenness centrality
- connected graphs
- random walk