## Congressus NumerantiumUtilitas Mathematica Pub. Incorporated, 1988 - Mathematics |

### 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 | |

23 other sections not shown

### Common terms and phrases

1-factor 2-connected 4-regular A-trail adjacent algorithm alternative algebras applied association types assume bipartite graph block bound breadth-first search chord chordal graph circuit decomposition closed arc combinatorial complete graph components consider construction contains Corollary corresponding cycle cyclic defined degree deleted denote depth-first search digraphs Duality edge reconstructible equation eulerian graph eulerian trail example exists failures families of graphs Figure Fractional Programming function given graph G Graph Theory Harary Hence hypomorphic identity induced integer isomorphic k-terminal recursive family labeling Lemma Let G linear Math Mathematics matrix maximal clique maximum mesh method n-extendable n/2 MCS nodes non-reconstructable number of edges number of vertices obtained pair paper perfect matching permutation planar graphs points polynomial primal graphs problem proof of Theorem prove random reconstruction conjecture result series-parallel graphs signed graphs Skolem-graceful spanning tree subgraph Suppose system of transitions total graph vector vertex