Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel by
122,37 €
On the Problem of Relative Components of Minimal Graphs. - A Recursive Bound for the Number of Complete K-Subgraphs of a Graph. - One-Factorizations of Tensor Products of Graphs. - The Complexity of the Graph Embedding Problem.
Jetzt bei Ebay:
