## Algebraic methods in graph theory, Issue 25, Volume 1Good,No Highlights,No Markup,all pages are intact, Slight Shelfwear,may have the corners slightly dented, may have slight color changes/slightly damaged spine. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

E Gyfiri Strongly connected digraphs with few cycles 251 | 7 |

Bardny System of representatives for sets whose convex hull | 19 |

Bose R Miskimins Partial geometric spaces | 37 |

Copyright | |

18 other sections not shown

### Other editions - View all

### Common terms and phrases

3-connected graph adjacency matrix ALGEBRAIC METHODS algorithm assume automorphism group binary bipartite graph Budapest Cayley graphs chain chromatic number COLLOQUIA MATHEMATICA SOCIETATIS combed Combinatorial complete graph conjecture connected constructed contradiction Corollary cubic graphs D.M. Cvetkovic define denote disjoint eigenvalues elements exists f.s.a. of degree Figure following theorem function fundamental matroid geometry graph G graph spectra graph theory Hence homeomorph Hungary hypergraph implies integer intersecting isomorphic JANOS BOLYAI JANOS BOLYAI 25 lattice Lemma Let G Let H Math MATHEMATICA SOCIETATIS JANOS matroid METHODS IN GRAPH natural number non-separating cycles obtain odd-generated output tournament path permutation group planar planar graph polynomial prime problem Proposition prove regular graph rotational tournament S-rings satisfying sequence set system SOCIETATIS JANOS BOLYAI solvable spectrum strongly regular graph subgraph subgroup submodular supermatroid subset Suppose that G SZEGED SZEGED HUNGARY tree v-critical vectors vertex vertices