Content deleted Content added
"enumerated" seems to make the definition easier to intuit for me than just "ordered" |
m Citations: [Pu178]Tweaked: url. You can use this bot yourself! Report bugs here. |
||
Line 16:
*{{cite journal|author=W. Lipski Jr.|coauthors=[[Franco P. Preparata]]|year=1981|month=August|title=Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems|journal=Acta Informatica|volume=15|issue=4|pages=329–346|doi=10.1007/BF00264533|url=http://www.springerlink.com/content/u18656lrg6424n3u/|accessdate=2009-07-20}}
*{{cite journal|author=Ten-hwang Lai|coauthors=Shu-shang Wei|year=1997|month=April|title=Bipartite permutation graphs with application to the minimum buffer size problem|journal=Discrete Applied Mathematics|volume=74|issue=1|pages=33–55|doi=10.1016/S0166-218X(96)00014-5|url=http://citeseer.ist.psu.edu/old/lai94bipartite.html|accessdate=2009-07-20}}
*{{cite book|title=Efficient graph representations|author=Jeremy P. Spinrad|year=2003|publisher=[[American Mathematical Society|AMS]] Bookstore|isbn= 9780821828151 |page=128|url=http://books.google.com/
*{{cite book|title=Graph classes: a survey|author=Andreas Brandstädt|coauthors=Van Bang Le; Jeremy P. Spinrad|year=1999|publisher=[[Society for Industrial and Applied Mathematics|SIAM]]|isbn=9780898714326 |page=94|url=http://books.google.com/
{{math-stub}}
| |||