| Call Number (LC) | Title | Results |
|---|---|---|
| QA166.2 .S3713 2003 | Trees / | 1 |
| QA166.2 .T74 1996 |
Trees : workshop in Versailles, June 14-16, 1995 / Trees workshop in Versailles, June 14-16, 1995 / |
2 |
| QA166.2 .W8 2004 | Spanning trees and optimization problems | 1 |
| QA166.2 .Y8 2015eb | Human action analysis with randomized trees / | 1 |
| QA166.22 |
Paths: Why is life filled with so many detours?. Understanding the shortest path first algorithm LiveLessons : networking talks / |
2 |
| QA166.22 C93 1985 | Cycles in graphs / | 1 |
| QA166.22 .C93 1985eb | Cycles in graphs | 1 |
| QA166.22 .G85 2021 | Paths : why is life filled with so many detours? / | 1 |
| QA166.22 .H8213 1997 | Extremal paths in graphs : foundations, search strategies, and related topics / | 1 |
| QA166.22 .N38 1987 | Cycles and rays / | 1 |
| QA166.23 |
Hypergraph computation / Hypergraph theory in wireless communication networks / Hypergraph Theory : an Introduction / |
4 |
| QA166.23 .B4813 1989eb | Hypergraphs combinatorics of finite sets / | 1 |
| QA166.23 .B74 2013 | Hypergraph theory an introduction / | 1 |
| QA166.23 .H46 2020 | Transversals in linear uniform hypergraphs / | 1 |
| QA166.23 .K44 2014 |
A geometric theory for hypergraph matching / A geometric theory for hypergraph matching |
3 |
| QA166.23 .V65 2002 | Coloring mixed hypergraphs : theory, algorithms, and applications / | 1 |
| QA166.242 .S65 2003 | Efficient graph representations / | 1 |
| QA166.243 |
Genetic theory for cubic graphs / Properly Colored Connectivity of Graphs / Generalized connectivity of graphs / |
3 |
| QA166.243 .M65 2012eb | Applications of combinatorial matrix theory to Laplacian matrices of graphs | 1 |
| QA166.243 .N34 2008 | Algorithmic aspects of graph connectivity / | 1 |
