Proceedings of the Fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing Held at Louisiana State University, March 5-8, 1984. |
Contents
Kantor | 7 |
Abouabdillah and J M Turgeon | 19 |
J Abrham and A Kotzig | 81 |
Copyright | |
15 other sections not shown
Common terms and phrases
1-factor F 2-chromatic 56 AUTOMORPHISM GROUP adjacent algorithm ancestor assume AUTOMORPHISM GROUP AUTOMORPHISM GROUP CORDER biconnected graph bipartite cell chordal graph chromatic index CL G CL(G clique cograph colouring Combinatorics Computer construction contains cotree cubic graph defined denote disjoint edge incident example exists F₂ finite four vertices G is Class G₁ G₂ GABS given graph G Graph Theory Hamiltonian circuit Hamiltonian cycle Hence house of order induced isomorphic joined K₁ labeled least common multiple Lemma Lemma 12 Let G marked onpath Math matrices maximum degree minimum vertex cover mod p¹ negative cycle negative edges node NP-complete pair partition polynomial problem proof of Theorem Proposition recursive result s-t path sequence SET NUMBER shortest paths spanning tree starter-adder Steiner systems subgraph subset subtree Suppose triangles undirected graph V₁ valuation vertex cover set vertices of degree vertices of maximum ง ง ง