scientific article; zbMATH DE number 3308125
From MaRDI portal
Publication:5589124
Cited in
(only showing first 100 items - show all)- 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
- On the beta-number of forests with isomorphic components
- 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
- New parameters for studying graceful properties of graphs
- On -fold Rosa-type labelings of bipartite multigraphs
- A possible analogue of -labellings for 3-uniform hypergraphs
- (Di)graph products, labelings and related results
- Decomposition of 8-regular graphs into paths of length 4
- The distance magic index of a graph
- On the beta-number of linear forests with an even number of components
- On the embedding of cone graphs in the line with distinct distances between neighbors
- Decomposition of complete bipartite graphs into generalized prisms
- Some graceful three distant trees by component moving operation
- Some results on graceful and sequential powerset-valued graphs
- Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs
- 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\)
- Products of graceful bipartite graphs
- New classes of graceful trees
- Preservation of the classical meanness property of some graphs based on line graph operation
- Decomposition of complete graphs into arbitrary trees
- \(k\)-Zumkeller labeling of super subdivision of some graphs
- Strongly edge multiplicative graphs
- On the number of heterochromatic trees in nice and beautiful colorings of complete graphs
- On gracefully and harmoniously labeling zero-divisor graphs
- Alpha labeling of cyclic graphs
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings
- On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs
- Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1
- Orthogonal labeling for some different infinite graph classes
- A paradigmatic approach to investigate restricted hyper totient graphs
- The vertex Euclidean properties of graphs
- Rainbow spanning trees in abelian groups
- Edge consecutive gracefulness of a graph
- Balanced equi-n-squares
- Embedding rainbow trees with applications to graph labelling and decomposition
- A proof of Ringel's conjecture
- New perspectives on classical meanness of some ladder graphs
- \(\alpha\)-labelings of a class of generalized Petersen graphs
- Strong labelings of linear forests
- On \(\alpha\)-labellings of lobsters and trees with a perfect matching
- Edge \(\delta\)-graceful labeling for some cyclic-related graphs
- Fuzzy magic labeling of simple graphs
- Edge even graceful labeling of polar grid graphs
- Edge even graceful labeling of cylinder grid graph
- Edge even graceful labeling of some graphs
- Difference cordiality of product related graphs
- Decomposing 8-regular graphs into paths of length 4
- The corona between cycles and paths
- A new application of the \(\otimes_h\)-product to \(\alpha\)-labelings
- Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
- Distance antimagic labeling of join and corona of two graphs
- Edge odd graceful labeling of some path and cycle related graphs
- Graceful labeling of some zero divisor graphs
- Distance antimagic labeling of the ladder graph
- On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders
- \(\rho\)-valuations for some stunted trees
- Cycle-magic graphs
- \(\Theta\)-graceful labelings of partial cubes
- On twin edge colorings of graphs
- All uniform bow graphs are graceful
- Graph decompositions, handcuffed prisoners and balanced p-designs
- On 0-rotatable graceful caterpillars
- On cyclic decompositions of the complete graph into the bipartite generalized Petersen graph \(P ( n , 3 )\)
- On graceful antimagic graphs
- A characterization for topologically integer additive set-indexer of graphs
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)