Combinatorics for Computer Science |
Other editions - View all
Common terms and phrases
a₁ B₁ B₂ backedges basic bicomponent biconnected graph bijection bipartite bipartite graph blocks bridge Burnside's lemma called coefficients coimage colex order column combinatorial components compute connected Consider construct COROLLARY corresponding cycle cycle index CYCLE(e data structures define DEFINITION diagram discussion disjoint edges elements embedding equivalence relation example EXERCISE finite given graph G idea identity incidence algebra injective mappings insertion integers inverse labeled LEMMA Let G lex list lex order lexicographic lineal spanning tree linear linearly ordered set Math matroid Möbius Möbius function nondecreasing functions notation obtained order isomorphism ordered partition orderly algorithm path PATH(e PATR(G,T permutation planar Pólya action polynomial poset preorder problem procedure proof rank reader recursion representation result RG functions rooted tree rotations S₁ SEGLST(e segment separation pair shown in FIGURE sorting network sorting strategy square subgraph subgroup subsets subtree symbols TAIL(F theory UNRANK vertex vertices wreath product