# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1361826192 3600
# Node ID 996d996d4f4055668fa5b25105512d3967a7e989
# Parent 2a1c85601d8aec7b115cbef07a32c79298aa8f12
Bad bibliographical reference in graphs/generic_graph.py
diff git a/sage/graphs/generic_graph.py b/sage/graphs/generic_graph.py
a

b


4440  4440  ALGORITHM: 
4441  4441  
4442  4442  Mixed Integer Linear Program. The formulation can be found 
4443   in [JVNC]_. 
 4443  in [LPForm]_. 
4444  4444  
4445  4445  There are at least two possible rewritings of this method 
4446  4446  which do not use Linear Programming: 
… 
… 

4492  4492  
4493  4493  REFERENCES: 
4494  4494  
4495   .. [JVNC] David Joyner, Minh Van Nguyen, and Nathann Cohen, 
4496   Algorithmic Graph Theory, 
4497   http://code.google.com/p/graphtheoryalgorithmsbook/ 
 4495  .. [LPForm] Nathann Cohen, 
 4496  Several Graph problems and their Linear Program formulations, 
 4497  http://hal.archivesouvertes.fr/inria00504914/en 
4498  4498  
4499  4499  .. [KaisPacking] Thomas Kaiser 
4500  4500  A short proof of the treepacking theorem 
… 
… 

5983  5983  # ILP formulation without constraint generation # 
5984  5984  ################################################# 
5985  5985  
5986   
5987   
5988  5986  p = MixedIntegerLinearProgram(maximization = False, solver = solver) 
5989  5987  
5990  5988  f = p.new_variable() 