scientific article; zbMATH DE number 3308125
From MaRDI portal
Publication:5589124
zbMath0193.53204MaRDI QIDQ5589124
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
On the generation of alpha graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path ⋮ Unnamed Item ⋮ On gap-labellings of some families of graphs ⋮ E-super arithmetic graceful labelling of \(H_i(m, m)\), \(H_i^{(1)}(m, m)\) and chain of even cycles ⋮ The integer-antimagic spectra of a disjoint union of Hamiltonian graphs ⋮ The maximum linear arrangement problem for trees under projectivity and planarity ⋮ Graceful labeling construction for some special tree graph using adjacency matrix ⋮ One curious identity counting graceful labelings ⋮ Graph Labelings: A Prime Area to Explore ⋮ Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges ⋮ Finding large rainbow trees in colourings of \(K_{n, n}\) ⋮ k-Zumkeller graphs through splitting of graphs ⋮ DIVISOR CORDIAL LABELING FOR SOME SNAKES AND DEGREE SPLITTING RELATED GRAPHS ⋮ Additively graceful signed graphs ⋮ Total Edge Irregularity Strength of the Cartesian Product of Bipartite Graphs and Paths ⋮ On (F, H)-simultaneously-magic labelings of graphs ⋮ A note on m-Zumkeller cordial labeling of graphs ⋮ Conservative trees ⋮ Cordial Labeling of Corona Product between Paths and Fourth Power of Paths ⋮ MMD labeling of EASS of Jewel graph ⋮ Graph and hypergraph packing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Almost all trees are almost graceful ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Edge even graceful labeling of torus grid graph ⋮ -labeling of supersubdivided connected graph plus an edge ⋮ On the strong beta-number of galaxies with three and four components ⋮ Generating graceful unicyclic graphs from a given forest ⋮ Binomial trees are graceful ⋮ m-Bonacci graceful labeling ⋮ Some families of $alpha$-labeled subgraphs of the integral grid ⋮ Optimal maximal graphs ⋮ Unnamed Item ⋮ $k$-odd mean labeling of prism ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Novel classes of integers and their applications in graph labeling ⋮ Productive and sum graph labelings: a survey ⋮ Directed edge-graceful labeling of digraph consisting of c cycles of the same size ⋮ Odd-even gracefulness of splitting graph of some standard graphs ⋮ Graceful labeling of power graph of group Z2k−1 × Z4 ⋮ Decompositions into linear forests and difference labelings of graphs ⋮ On k-graceful, countably infinite graphs ⋮ On the cyclic decomposition of complete graphs into almost-bipartite graphs ⋮ On the relations between certain graph labelings ⋮ All 2-regular graphs consisting of 4-cycles are graceful ⋮ The gracefulness of the join of graphs. II ⋮ Properly even harmonious labelings of disconnected graphs ⋮ Even harmonious labelings of disjoint graphs with a small component ⋮ Alpha labelings of full hexagonal caterpillars ⋮ New classes of graceful unicyclic graphs ⋮ The gracefulness of the join of graphs ⋮ Towards optimal embedding of an arbitrary tree in a graceful tree ⋮ \(k\)-Zumkeller labeling for twig graphs ⋮ Gracefully cultivating trees on a cycle ⋮ Graceful digraphs and complete mappings ⋮ Super edge magic graceful labeling of generalized Petersen graphs ⋮ A new measure for gracefulness of graphs ⋮ Super total graceful graphs ⋮ Graceful and cordial labeling of subdivision of graphs ⋮ Generating graceful trees from caterpillars by recursive attachment ⋮ Further results on graceful directed graphs ⋮ Edge-graceful labelings of connected graphs ⋮ On the beta-number of forests with isomorphic components ⋮ Further results on super graceful labeling of graphs ⋮ \(\alpha\)-labeling number of trees ⋮ New families of graphs that have \(\alpha\)-labelings ⋮ On modular edge-graceful graphs ⋮ Graceful valuations of 2-regular graphs with two components ⋮ Orthogonal double covers of complete graphs by trees ⋮ Bi-cyclic decompositions of complete graphs into spanning trees ⋮ The subdivision graph of a graceful tree is a graceful tree ⋮ Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\) ⋮ Labelings in Cayley digraphs ⋮ Cubic factorizations ⋮ 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 ⋮ A complete solution to the two-table Oberwolfach problems ⋮ Tree-designs with balanced-type conditions ⋮ New parameters for studying graceful properties of graphs ⋮ On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs ⋮ A possible analogue of \(\rho\)-labellings for 3-uniform hypergraphs ⋮ (Di)graph products, labelings and related results ⋮ Decomposition of 8-regular graphs into paths of length 4 ⋮ Strongly graceful graphs
This page was built for publication:
