## Congressus Numerantium, Volumes 74-75; Volume 1990 |

### What people are saying - Write a review

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

### Contents

R Garrett A Geometric Approach to the Traveling Salesman Problem | 5 |

A Vince Modular Chromatic Number | 11 |

K Soumyanath and J S Deogun On the Bisection Width of Partial trees | 25 |

Copyright | |

17 other sections not shown

### Common terms and phrases

adjacency matrix adjacent algebra algorithm biclique CCSE chromatic number clique color complete graph complex Hadamard matrices complex Hadamard matrix computation connected component consider construction contains core-nodes Corollary corresponding D-neofield decomposition defined degree-two nodes denote diagonal diagram digraph edge-graceful edge-graceful labeling elements equation error example exists Figure full-classes function fundamental cycle Gg-network given graph G Graph Theory Hadamard matrices Hamiltonian cycle Hence k-tree labels lattice Lemma LU decomposition Math matroid maximum number med(G method NP-complete number of edges number of separating obtained odd link optimal output partial fc-trees partition path planar layout plane of order polynomial poset positive integer problem projective plane Proof reduced Remez Remez algorithm result root row sum satisfies scordatura separating pair separating triplets sequence series-parallel series-parallel graph spanning tree step subgraph subset T-coloring Theorem Theory third type tree edge unique neighbor upper bound values vector vertex vertices