Revision as of 03:43, 12 May 2010 edit Justin W Smith (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 5,998 edits →Formal definition: wikilink for bijective ← Previous edit		Revision as of 03:49, 12 May 2010 edit undo Justin W Smith (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 5,998 edits "enumerated" seems to make the definition easier to intuit for me than just "ordered" Next edit →
Line 1: In the [[mathematical]] field of [[graph theory]], a '''convex bipartite graph''' is a [[bipartite graph]] with specific properties. A bipartite graph, (''U'' ∪ ''V'', ''E''), is said to be convex over the vertex set ''U'' if ''U'' can be [[~~total order\|ordered~~enumerate]]d such that for all ''v'' ∈ ''V'' the vertices adjacent to ''v'' are consecutive. Convexity over ''V'' is defined analogously. A bipartite graph (''U'' ∪ ''V'', ''E'') that is convex over both ''U'' and ''V'' is said to be '''biconvex''' or '''doubly convex'''.

Convex bipartite graph: Difference between revisions