Congressus Numerantium, المجلد 168

2n-cyclic blended labeling algorithm array of alternatives binary Carlitz caterpillar complete graphs Computer CONGRESSUS NUMERANTIUM 168 connected graph construction Corollary crossing number cyclic decomposition defined deg(v difference sets dominating set EA(j exists factors fractional dominating function graceful labeling graph G group of order H₁ Hamilton cycle integer intersection numbers isomorphic k-attack k-wise independence Lemma Let G magic constant Math matroid maximal outerplanar graph maximum fractional packing minimum fractional dominating MRST multigraph normal subgroup number of compositions number of vertices obtain orbit outerplanar graph packing null vertices packing of G palindromic compositions partial latin square partite sets permutation planar planar graph Proposition random variables randomized algorithm rectilinear regular graphs result sample space set of G spanning tree SPM labeling Steiner tree subgraph subset Sylow p-subgroup symmetric ta₁ ta₂ tn(G U₁ V₁ vertex set well-spread halving Z2 homomorphic image