## Ars Combinatoria, Volume 38Department of Combinatorics and Optimization, University of Waterloo., 1994 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

A Theorem on nExtradable Graphs by Tsuyoshi Nishimura | 3 |

On locally narcstrong digraphs by Zhibo Chen | 27 |

Some Joint Distributions Concerning Random Walk in a Plane by Jagdish Saran | 33 |

Copyright | |

23 other sections not shown

### Other editions - View all

### Common terms and phrases

00 determine 3-packing adjacent assume automorphism biconnected block circuit clgpd clique-Helly columns Combinatorial conference matrix connected consider construct contradiction Corollary countable cubic graph cycles defined Definition denote digraph disjoint dominating set domination number DTS(v edge reconstructible elements equivalent exactly exists Figure G contains G E(G G is edge graceful labeling graph G Graph Theory grid graphs Hence hypergraph incidence matrix integer interval isomorphic Lemma Lemma 2 shows Let G maxcliques maximal minimum number n-ary design n-extendable non-repetitive number of paths obtain old quadrilateral outer-planar pair path of length pins planar planar graph polygon positive integer primary decomposition primary graphs problem proof of Theorem prove pseudo dual pseudograph Q has form quadrilateral quadrilateral chain r-compositions rectilinear residual cliques satisfies series-parallel spanning Steiner triple system subgraph subgraph of G subset Suppose symmetric t-sc graph tournament upper bound vertex