Proceedings of the Fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing Held at Louisiana State University, March 5-8, 1984. |
From inside the book
Results 1-3 of 17
Page 138
... Combinatorial Theory Ser . B , 35 ( 1983 ) , 39-61 . 10. Neil Robertson and P. D. Seymour , " Graph Minors . II . Algorithmic aspects of tree - width " , submitted . 11. Neil Robertson and P. D. Seymour , " Graph Minors . IV . Tree ...
... Combinatorial Theory Ser . B , 35 ( 1983 ) , 39-61 . 10. Neil Robertson and P. D. Seymour , " Graph Minors . II . Algorithmic aspects of tree - width " , submitted . 11. Neil Robertson and P. D. Seymour , " Graph Minors . IV . Tree ...
Page 159
... Combinatorial problems in the theory of graphs , Proc . Nat . Acad . Sci . USA . P. Hall , On representations of subsets , J. London Math . Soc . 10 ( 1934 ) 26-30 . F. Harary , " Graph Theory , " Addison - Wesley , 1969 . R. Jamison ...
... Combinatorial problems in the theory of graphs , Proc . Nat . Acad . Sci . USA . P. Hall , On representations of subsets , J. London Math . Soc . 10 ( 1934 ) 26-30 . F. Harary , " Graph Theory , " Addison - Wesley , 1969 . R. Jamison ...
Page 249
... Combinatorial Structures , Cambridge Univ . Press , London / New York , 1979 . 2. H.R. Brahana , Regular maps and their groups , Amer . J. Math . 49 ( 1927 ) , 268-284 . 3. H.S.M. Coxeter and W.O.J. Moser , " Generators and Relations ...
... Combinatorial Structures , Cambridge Univ . Press , London / New York , 1979 . 2. H.R. Brahana , Regular maps and their groups , Amer . J. Math . 49 ( 1927 ) , 268-284 . 3. H.S.M. Coxeter and W.O.J. Moser , " Generators and Relations ...
Contents
H Niederhausen v | 5 |
Palem and D S Fussel | 13 |
Paoli and W T Trotter | 19 |
Copyright | |
26 other sections not shown
Common terms and phrases
activity algorithm asymptotic cost authentication system automorphism average bijection bitog block C₁ coDP combinatorial Computer coNP construction contains Corollary corresponding cycle permutation graphs defined denote determine disjoint dominating set embedded encoding rule equivalent example exists Figure finite flag transitive maps G₂ given graph embedded graph G Graph Theory H(IMS Hamiltonian Hamiltonian cycle hence holey SOLSSOM hyperedge hypergraph integer isomorphic labeled left-right paths Lemma length m-gons makespan matched trees Math move-to-front node NP coNP NP-complete number of edges number of vertices O(nlogn obtained optimal strategy oriented pair parameters partition permutation graphs planar graphs points polygons Proof RD-set resource type sample scheduling sequence series-parallel graph signed graph SOLSSOM of type subgraph subset surface surjections symmetrical map Theorem transmitter triangles two-graph v¹¹ v¹º Venn diagram vertex W.T. Tutte weak records