| 05C05 |
- |
Trees |
- |
29 |
items |
| 05C10 |
- |
Topological graph theory, imbedding |
- |
12 |
items |
| 05C12 |
- |
Distance in graphs |
- |
5 |
items |
| 05C15 |
- |
Coloring of graphs and hypergraphs |
- |
19 |
items |
| 05C20 |
- |
Directed graphs (digraphs), tournaments |
- |
8 |
items |
| 05C25 |
- |
Graphs and groups |
- |
5 |
items |
| 05C30 |
- |
Enumeration of graphs and maps |
- |
3 |
items |
| 05C38 |
- |
Paths and cycles |
- |
16 |
items |
| 05C40 |
- |
Connectivity |
- |
7 |
items |
| 05C45 |
- |
Eulerian and Hamiltonian graphs |
- |
12 |
items |
| 05C50 |
- |
Graphs and matrices |
- |
7 |
items |
| 05C60 |
- |
Isomorphism problems (reconstruction conjecture, etc.) |
- |
2 |
items |
| 05C62 |
- |
Graph representations (geometric and intersection representations, etc.) |
- |
1 |
item |
| 05C65 |
- |
Hypergraphs |
- |
15 |
items |
| 05C69 |
- |
Dominating sets, independent sets, cliques |
- |
6 |
items |
| 05C70 |
- |
Factorization, matching, covering and packing |
- |
7 |
items |
| 05C75 |
- |
Structural characterization of types of graphs |
- |
9 |
items |
| 05C78 |
- |
Graph labelling (graceful graphs, bandwidth, etc.) |
- |
2 |
items |
| 05C80 |
- |
Random graphs |
- |
5 |
items |
| 05C83 |
- |
Graph minors |
- |
2 |
items |
| 05C85 |
- |
Graph algorithms |
- |
4 |
items |
| 05C90 |
- |
Applications |
- |
2 |
items |
| 05C99 |
- |
Miscellaneous |
- |
32 |
items |
|
|
[
up
|
top
]
|
