Revision as of 20:26, 16 February 2015 edit J. Finkelstein (talk \| contribs) Extended confirmed users 2,673 edits m →Formal definition: removes explicit enumeration bounds, the step size is implicit ← Previous edit		Revision as of 20:32, 17 June 2015 edit undo Ketiltrout (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 81,892 edits m dab 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 [[~~enumerate~~enumeration\|enumerated]]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