## Proceedings of the fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing held at Louisiana State University, March 5-8, 1984, Volume 1 |

### What people are saying - Write a review

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

### Contents

Kantor | 7 |

B A Anderson | 23 |

H Archdeacon J H Dinitz and W D Wallis | 45 |

Copyright | |

13 other sections not shown

### Common terms and phrases

1-factor F 2-chromatic adjacent algorithm ancestor assume AUTOMORPHISM CROUP biconnected graph bipartite block cell chordal graph chromatic index CL(G clique cograph colouring Combinatorics Computer construction cotree cubic graph cycle of length defined denote disjoint edge incident encoding rule example exists Figure forests four vertices G E(G G is Class given graph G Graph Theory Hamiltonian cycle Hence house of order induced isomorphic labeled LC(G least common multiple Lemma Lemma 13 Let G marked onpath Math matrices maximum degree minimum vertex cover mod pn modulo negative cycle negative edges node NP-complete number of vertices OCSTP optimum orthogonal pair partition polynomial prime power problem projective planes proof of Theorem properties Proposition recursive result s-t path SET NUM8ER shortest paths spanning tree SQS's starter-adder Steiner systems STS(v subgraph G subset subtree Suppose triangles undirected graph valuation vertex cover set vertices of degree vertices of maximum