## Congressus numerantium, Volume 1; Volume 63 |

### What people are saying - Write a review

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

### Contents

H Fleischner Some Blood Sweat But no Tears in Eulerian Graph Theory | 8 |

Read Methods for Computer Display and Manipulation of Graphs | 49 |

R P JONES A Computer Representation for Graph Theory Knowledge 64131 | 63 |

Copyright | |

14 other sections not shown

### Common terms and phrases

1-factor 2n+l 4-regular A-trail adjacent basis graph blocks breadth-first search chord circuit decomposition complete bipartite graphs complete graphs components composition operations construct contains copies corresponding cutset cutvertex cutvertices cyclic defined deleted denote depth-first search digraphs Discrete Math edge reconstructible embedding eulerian graph eulerian trail example factor families of graphs family of partial finite Frank Harary given graph G graph reconstruction graph theory graphs are reconstructible harmonious coloring hypomorphic hypomorphic mapping set infinite graphs integer isomorphic joined k-terminal recursive family k-trees labels Lemma Let G Mathematics matrices method multigraph n-extendable graphs non-reconstructable digraphs noncyclic number of edges number of vertices obtained orbits pairs perfect matching permutation planar graphs planarity testing plane drawing Pn x Pn points PQ-tree procedure proof prove Q-vertex random graph reconstruction conjecture result root series-parallel graphs signed graphs simple graphs spanning tree Stockmeyer structure Theorem tournaments vertex