scientific article; zbMATH DE number 3308125
From MaRDI portal
Publication:5589124
Cited in
(only showing first 100 items - show all)- Spanning cubic graph designs
- A complete solution to the two-table Oberwolfach problems
- On Graceful Directed Graphs
- On Additive Bases and Harmonious Graphs
- On the existence of balanced bipartite designs. II
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- On graceful antimagic graphs
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- Factorization of \(K_{n,n}\) into \((0,j)\)-prisms
- (Di)graph products, labelings and related results
- scientific article; zbMATH DE number 7528092 (Why is no real title available?)
- Strong labelings of linear forests
- \(\rho\)-valuations for some stunted trees
- Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
- Labelings of a certain class of convex polytopes
- The distance magic index of a graph
- Strongly indexable graphs
- Graph decompositions, handcuffed prisoners and balanced p-designs
- On modular edge-graceful graphs
- Cubic factorizations
- On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph
- The joint sum of graceful trees
- On graceful spider graphs with at most four legs of lengths greater than one
- Labelings in Cayley digraphs
- Tree-designs with balanced-type conditions
- Decompositions of regular bipartite graphs
- Harmonic mean labeling of disconnected graphs
- Perfect difference families, perfect difference matrices, and related combinatorial structures
- New parameters for studying graceful properties of graphs
- On Skolem graceful graphs
- Embedding an arbitrary tree in a graceful tree
- New descriptions of certain classes of graceful graphs
- On the number of unlabeled vertices in edge-friendly labelings of graphs
- Bi-cyclic decompositions of complete graphs into spanning trees
- ON SIGNED MAGIC CORDIAL LABELING
- On gracefully and harmoniously labeling zero-divisor graphs
- Some progress on \((v,4,1)\) difference families and optical orthogonal codes
- Further results on \((v,4,1)\)-perfect difference families
- Novel classes of integers and their applications in graph labeling
- 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
- Another class of balanced graph designs: Balanced circuit designs
- Sequentially additive graphs
- \(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
- Strongly graceful 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
- New families of graphs that have \(\alpha\)-labelings
- Decomposition of certain complete bipartite graphs into prisms
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
- Further results on super graceful labeling of graphs
- On \(k\)-super graceful labeling of graphs
- Productive and sum graph labelings: a survey
- Orthogonal double covers of complete graphs by trees
- Constructions for cyclic Moebius ladder systems
- The subdivision graph of a graceful tree is a graceful tree
- \(\Theta\)-graceful labelings of partial cubes
- Decompositions of complete graphs into isomorphic cubes
- Decomposition of complete bipartite graphs into generalized prisms
- Graceful labelings of nearly complete graphs
- On the cyclic decomposition of complete graphs into almost-bipartite graphs
- Cycle-magic graphs
- A review on graceful and sequential integer additive set-labeled graphs
- On k-graceful, locally finite graphs
- Graceful centers of graceful graphs and universal graceful graphs
- Trees having an even or quasi even degree sequence are graceful
- 0-centred and 0-ubiquitously graceful trees.
- A study on topological integer additive set-labeling of graphs
- Decomposition of complete graphs into arbitrary trees
- A note on m-Zumkeller cordial labeling of graphs
- Applications of additive sequence of permutations
- A new application of the \(\otimes_h\)-product to \(\alpha\)-labelings
- On k-graceful, countably infinite graphs
- A substitution theorem for graceful trees and its applications
- The radical product of graceful trees
- Equivalencies of cordial labeling and sum divisor cordial labeling
- Decompositions into linear forests and difference labelings of graphs
- A parallel fast boundary element method using cyclic graph decompositions
- 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
- On the beta-number of forests with isomorphic components
- Distinct distance sets in a graph
- Foreword to the special issue ``Advances in graph labelling
- Graceful 2-regular graphs and Skolem sequences
- The corona between cycles and paths
- Orthogonal labeling for some different infinite graph classes
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)