Publication:5589124
From MaRDI portal
zbMath0193.53204MaRDI QIDQ5589124
Publication date: 1967
Related Items
Labelings in Cayley digraphs, On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph, On the number of unlabeled vertices in edge-friendly labelings of graphs, Constructions for cyclic Moebius ladder systems, On k-graceful, locally finite graphs, \(\alpha\)-labeling number of trees, Bi-cyclic decompositions of complete graphs into spanning trees, Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\), Simply sequentially additive labelings of 2-regular graphs, Decompositions of complete graphs into blown-up cycles \(C_m\)[2], Further results on \((v,4,1)\)-perfect difference families, Factorization of \(K_{n,n}\) into \((0,j)\)-prisms, Trees having an even or quasi even degree sequence are graceful, On explicit formulas for bandwidth and antibandwidth of hypercubes, A substitution theorem for graceful trees and its applications, A non-existence result on cyclic cycle-decompositions of the cocktail party graph, Spanning cubic graph designs, Applications of additive sequence of permutations, On k-graceful, countably infinite graphs, Strongly graceful graphs, Products of graceful trees, Difference systems, graph designs, and coloring problems, On k-sequential and other numbered graphs, Decompositions of complete graphs into isomorphic cubes, Decompositions of regular bipartite graphs, Foreword to the special issue ``Advances in graph labelling, Graceful 2-regular graphs and Skolem sequences, Strongly indexable graphs, Distinct distance sets in a graph, On Skolem graceful graphs, Labelings of a certain class of convex polytopes, Another class of balanced graph designs: Balanced circuit designs, The factorial representation of balanced labelled graphs, The joint sum of graceful trees, The radical product of graceful trees, Decompositions into linear forests and difference labelings of graphs, On the relations between certain graph labelings, All 2-regular graphs consisting of 4-cycles are graceful, New families of graphs that have \(\alpha\)-labelings, Orthogonal double covers of complete graphs by trees, The subdivision graph of a graceful tree is a graceful tree, 0-centred and 0-ubiquitously graceful trees., Graceful labelings of nearly complete graphs, Some progress on \((v,4,1)\) difference families and optical orthogonal codes, Sequentially additive graphs, On the existence of balanced bipartite designs. II, On the cyclic decomposition of complete graphs into almost-bipartite graphs, Graceful valuations of 2-regular graphs with two components, Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\), Strong labelings of linear forests, \(\rho\)-valuations for some stunted trees, Cycle-magic graphs, \(\Theta\)-graceful labelings of partial cubes, Graph decompositions, handcuffed prisoners and balanced p-designs, Perfect difference families, perfect difference matrices, and related combinatorial structures, Edge-decompositions ofKn,ninto isomorphic copies of a given tree, Graceful Signed Graphs, Graceful Labeling of Balanced Stars of Paths, On Graceful Directed Graphs, On Additive Bases and Harmonious Graphs
