TITLE: Linear programming for combinatorics/graph theory
QUESTION [7 upvotes]: I just went to a graph theory talk talking about various fractional graph parameters (but focusing on one).  These were defined using linear programming.  A question was asked, "How can we learn more about this technique."  The answer given was, "There is not really a good resource for linear programming in combinatorics/graph theory."  He said Schrijver (spelling?) has a book but you'd have to wade through a lot of stuff to get the stuff that is most important to graph theory/combinatorics.
So, do any of you know of good references that are specifically geared toward graph theory/combinatorics?  It could be a book, chapter of a book, paper, whatever.  Thanks for any help!

REPLY [2 votes]: Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) (ISBN-13: 978-3642244872) and Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics) (ISBN-13: 978-3540443896)
The first as general introduction and enough for most cases, the latter as reference material covering basically the whole topic