|
QA166.23
|
Hypergraph computation /
Hypergraph Theory : an Introduction / |
2 |
|
QA166.23 .H46 2020
|
Transversals in linear uniform hypergraphs / |
1 |
|
QA166.23 .K44 2014
|
A geometric theory for hypergraph matching / |
1 |
|
QA166.245
|
Distributed graph analytics : programming, languages, and their compilation /
Large-scale graph analysis : system, algorithm and optimization /
Algebraic graph algorithms : a practical guide using Python /
A guide to graph algorithms /
Algorithms on trees and graphs : with Python code / |
5 |
|
QA166.245 .B488 2020
|
Beyond planar graphs : communications of NII Shonan meetings / |
1 |
|
QA166.245 .D56 2012
|
Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA / |
1 |
|
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 .G7 2004eb
|
Graph algorithms and applications 3 / |
1 |
|
QA166.245 .G72 2006eb
|
Graph algorithms and applications 4 / |
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.247 .D66 2005eb
|
Chromatic polynomials and chromaticity of graphs / |
1 |
|
QA166.247 .F75 2006
|
A Sharp threshold for random graphs with a monochromatic triangle in every edge coloring / |
1 |
|
QA166.247 .G73 2012eb
|
Graph edge coloring : Vizing's theorem and Goldberg's conjecture / |
1 |
|
QA166.247 .L38 2021
|
Guide to graph colouring : algorithms and applications / |
1 |
|
QA166.247 .O6813 2004
|
Graph colorings / |
2 |
|
QA166.25 .A87 1992
|
Designs and their codes / |
1 |
|
QA166.25 .B47 1993
|
Design theory / |
1 |
|
QA166.25 .C36 1991
|
Designs, graphs, codes, and their links / |
1 |