scientific article; zbMATH DE number 3308125

zbMATH Open0193.53204MaRDI QIDQ5589124FDOQ5589124

Authors: Alexander Rosa

Publication date: 1967

Title of this publication is not available (Why is that?)

zbMATH Keywords

topology

Cited In (only showing first 100 items - show all)

\(p^2\)-cycle decompositions of the tensor product of complete graphs
A characterization for topologically integer additive set-indexer of graphs
Decompositions of complete graphs into blown-up cycles \(C_m\)[2]
Simply sequentially additive labelings of 2-regular graphs
Products of graceful trees
Decomposition of complete graphs into arbitrary trees
Applications of additive sequence of permutations
Orthogonal labeling for some different infinite graph classes
\(\alpha\)-labeling number of trees
The smallest non-autograph
Trees having an even or quasi even degree sequence are graceful
Balanced equi-\(n\)-squares
On the relations between certain graph labelings
A review on graceful and sequential integer additive set-labeled graphs
The corona between cycles and paths
Difference systems, graph designs, and coloring problems
On the beta-number of forests with isomorphic components
Graph Labelings: A Prime Area to Explore
Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
Counting graceful labelings of trees: a theoretical and empirical study
On the number of heterochromatic trees in nice and beautiful colorings of complete graphs
The radical product of graceful trees
Decompositions into linear forests and difference labelings of graphs
Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles
The factorial representation of balanced labelled graphs
ODD GRACEFUL LABELING OF ARBITRARY SUPERSUBDIVISION OF CERTAIN GRAPHS
Graceful centers of graceful graphs and universal graceful graphs
0-centred and 0-ubiquitously graceful trees.
A parallel fast boundary element method using cyclic graph decompositions
Distinct distance sets in a graph
Foreword to the special issue ``Advances in graph labelling
Graceful 2-regular graphs and Skolem sequences
Graceful valuations of 2-regular graphs with two components
All 2-regular graphs consisting of 4-cycles are graceful
A substitution theorem for graceful trees and its applications
New classes of graceful trees
A note on m-Zumkeller cordial labeling of graphs
A possible analogue of \(\rho\)-labellings for 3-uniform hypergraphs
On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs
Decomposition of 8-regular graphs into paths of length 4
Not all partial cubes are \(\Theta \)-graceful
Super-edge magic total labeling in certain classes of graphs
On k-graceful, locally finite graphs
A study on topological integer additive set-labeling of graphs
Distance antimagic labeling of the ladder graph
On k-sequential and other numbered graphs
On k-graceful, countably infinite graphs
A new application of the \(\otimes_h\)-product to \(\alpha\)-labelings
Equivalencies of cordial labeling and sum divisor cordial labeling
Spanning cubic graph designs
The distance magic index of a graph
Decomposition of complete bipartite graphs into generalized prisms
Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
A non-existence result on cyclic cycle-decompositions of the cocktail party graph
Strongly graceful graphs
Decompositions of complete graphs into isomorphic cubes
(Di)graph products, labelings and related results
\(\Theta\)-graceful labelings of partial cubes
Bi-cyclic decompositions of complete graphs into spanning trees
A complete solution to the two-table Oberwolfach problems
On Graceful Directed Graphs
Orthogonal double covers of complete graphs by trees
On the cyclic decomposition of complete graphs into almost-bipartite graphs
Another class of balanced graph designs: Balanced circuit designs
Labelings of a certain class of convex polytopes
On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph
Novel classes of integers and their applications in graph labeling
Constructions for cyclic Moebius ladder systems
On explicit formulas for bandwidth and antibandwidth of hypercubes
Labelings in Cayley digraphs
ON SIGNED MAGIC CORDIAL LABELING
Title not available (Why is that?)
Alpha labelings of full hexagonal caterpillars
Even harmonious labelings of disjoint graphs with a small component
Properly even harmonious labelings of disconnected graphs
The gracefulness of the join of graphs. II
\(k\)-Zumkeller labeling for twig graphs
A new measure for gracefulness of graphs
Gracefully cultivating trees on a cycle
Graceful digraphs and complete mappings
New classes of graceful unicyclic graphs
The gracefulness of the join of graphs
Towards optimal embedding of an arbitrary tree in a graceful tree
Super edge magic graceful labeling of generalized Petersen graphs
Super total graceful graphs
Further results on graceful directed graphs
Generating graceful trees from caterpillars by recursive attachment
Graceful and cordial labeling of subdivision of graphs
Edge-graceful labelings of connected graphs
Strong labelings of linear forests
Further results on super graceful labeling of graphs
Productive and sum graph labelings: a survey
Perfect difference families, perfect difference matrices, and related combinatorial structures
Embedding an arbitrary tree in a graceful tree
On the existence of balanced bipartite designs. II
On modular edge-graceful graphs
Decompositions of regular bipartite graphs
On Skolem graceful graphs
Graph decompositions, handcuffed prisoners and balanced p-designs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589124)