Bipartite labelings of trees and the gracesize
From MaRDI portal
Publication:4326539
DOI10.1002/jgt.3190190207zbMath0818.05054OpenAlexW1988739150MaRDI QIDQ4326539
Publication date: 6 August 1995
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190190207
Related Items
On the generation of alpha graphs, Edge-decompositions ofKn,ninto isomorphic copies of a given tree, Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph, On the beta-number of forests with isomorphic components, Computer search for graceful labeling: a survey, Orthogonal double covers of complete graphs by trees, Some families of $alpha$-labeled subgraphs of the integral grid, Graceful labelling: state of the art, applications and future directions, Improved bounds for relaxed graceful trees, Strong labelings of linear forests, A substitution theorem for graceful trees and its applications, New attack on Kotzigs conjecture, Folding trees gracefully
Cites Work