Classes of graphs that can be partitioned to satisfy all their vertices.
Michael U. GerberDaniel KoblerPublished in: Australas. J Comb. (2004)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- hamiltonian cycle
- undirected graph
- maximal cliques
- graph theory
- directed graph
- attributed graphs
- connected subgraphs
- graph theoretic
- adjacency matrix
- graph matching
- algebraic structures
- vertex set
- subgraph isomorphism
- planar graphs
- graph representation
- graph databases
- directed edges