Congressus Numerantium, المجلد 168

algorithm apply assume attack bipartite blended labeling bound called complete complete graphs compositions Computer condition connected consider constant construction contains copies Corollary corresponding counter crossing number cycle cyclic defined Definition denote designs difference sets dominating set domination null edges elements entry equation Example exists factors Figure fixed forced fractional packing function given gives graceful graph G Hence homomorphic image independence induced integer intersection known labeling least Lemma length Let G magic Math matroid maximal maximum fractional method neighbor normal Note null vertices obtain occurs orbit p-labeling packing null pair palindromic partial latin square partite permutation points positive possible presented problem Proof Proposition prove region Remark respectively restriction result sample space satisfies spanning Steiner subgraph subgroup subset Suppose symmetric Theorem Theory tn(G tour tree unique University vertex vertices