| Call Number (LC) | Title | Results |
|---|---|---|
| QA166.245 .D56 2012eb | Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA / | 1 |
| QA166.245 .E73 2013 | Distributed graph algorithms for computer networks / | 1 |
| QA166.245 .G7 2004eb | Graph algorithms and applications 3 / | 1 |
| QA166.245 .G72 2006eb | Graph algorithms and applications 4 / | 1 |
| QA166.245 .G723 2011eb | Graph algorithms in the language of linear algebra | 1 |
| QA166.245.G73 2002 | Graph Algorithms and Applications 1. | 1 |
| QA166.245.G73 2004 | Graph Algorithms and Applications 2 : Solid-Electrolyte Interphase. | 1 |
| QA166.245 .G73 2006eb | Graph algorithms and applications 5 / | 1 |
| QA166.245 .H63 2010 | CATBox an interactive course in combinatorial optimization / | 1 |
| QA166.245 .L5 2011eb | Euclidean shortest paths : exact or approximate algorithms / | 1 |
| QA166.245 .O788 2015 | The shortest-path problem : analysis and comparison of methods / | 2 |
| QA166.245 .V35 2002 | Algorithms on trees and graphs / | 1 |
| QA166.245 .W66 2012eb | Shadow algorithms data miner / | 2 |
| QA166.247 |
A Kaleidoscopic view of graph colorings / Color-induced graph colorings / |
2 |
| QA166.247 .B273 2013 | Distributed graph coloring fundamentals and recent developments / | 1 |
| QA166.247 .C43 2009 | Chromatic graph theory | 1 |
| QA166.247 .C43 2020 | Chromatic Graph Theory / | 1 |
| QA166.247 D66 2005 | Chromatic polynomials and chromaticity of graphs / | 1 |
| QA166.247 .D66 2005eb | Chromatic polynomials and chromaticity of graphs / | 1 |
| QA166.247 .G73 2012eb | Graph edge coloring : Vizing's theorem and Goldberg's conjecture / | 1 |
