scientific article
From MaRDI portal
Publication:3892270
zbMath0447.05032MaRDI QIDQ3892270
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items (31)
Decompositions into linear forests and difference labelings of graphs ⋮ On k-graceful, countably infinite graphs ⋮ On Graceful Directed Graphs ⋮ The gracefulness of the join of graphs ⋮ Node-graceful graphs ⋮ Unnamed Item ⋮ Computer search for graceful labeling: a survey ⋮ The subdivision graph of a graceful tree is a graceful tree ⋮ Strongly graceful graphs ⋮ Products of graceful trees ⋮ On k-sequential and other numbered graphs ⋮ Almost all trees are almost graceful ⋮ 0-centred and 0-ubiquitously graceful trees. ⋮ Decompositions of regular bipartite graphs ⋮ Strongly indexable graphs ⋮ Distinct distance sets in a graph ⋮ Graceful labelling: state of the art, applications and future directions ⋮ All arbitrarily fixed generalized banana trees are graceful ⋮ Products of graceful bipartite graphs ⋮ Improved bounds for relaxed graceful trees ⋮ On \(\alpha\)-labellings of lobsters and trees with a perfect matching ⋮ Embedding an arbitrary tree in a graceful tree ⋮ Some graceful lobsters with all three types of branches incident on the vertices of the central path ⋮ On Graceful Labelings of Trees ⋮ A note on conservative graphs ⋮ Unnamed Item ⋮ Sequentially additive graphs ⋮ On lower bounds for numbered complete graphs ⋮ Unnamed Item ⋮ On gracefully and harmoniously labeling zero-divisor graphs ⋮ Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
This page was built for publication:
