A graph which has a link between every pair of nodes. A complete bipartite graph can be partitioned into two subsets of nodes such that each node is joined to every node in the other subset. (1995-01-24)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ bi ] [ bipartite graph ] [ bs ] [ ca ] [ ch ] [ co ] [ com ] [ complete ] [ de ] [ du ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ gr ] [ graph ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ jo ] [ join ] [ Lex ] [ li ] [ link ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ ne ] [ no ] [ node ] [ om ] [ pa ] [ partition ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ se ] [ set ] [ su ] [ th ] [ to ] [ tw ] [ ve ]