Hamiltonicity and circular distance two labellings
From MaRDI portal
Publication:5937459
DOI10.1016/S0012-365X(00)00299-5zbMath0977.05078MaRDI QIDQ5937459
Publication date: 8 January 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Group path covering and \(L(j,k)\)-labelings of diameter two graphs, On critical trees labeled with a condition at distance two, On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs, Distance-two labelings of digraphs, On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path, Distance-two labellings of Hamming graphs, On \(L(2,1)\)-labelings of Cartesian products of paths and cycles, Group path covering and distance two labeling of graphs, Distance two edge labelings of lattices, Radio number for trees, \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs, \(L(2,1)\)-labelings of Cartesian products of two cycles, A survey on labeling graphs with a condition at distance two, Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey