Hamiltonicity and circular distance two labellings

DOI10.1016/S0012-365X(00)00299-5zbMath0977.05078MaRDI QIDQ5937459

Daphne Der-Fen Liu

Publication date: 8 January 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonicity; path covering number; vertex-labelling

Mathematics Subject Classification ID

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C45: Eulerian and Hamiltonian graphs

Related Items

On circular-L(2, 1)-labellings of products of graphs, On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs, \(L(j,k)\)-labeling number of Cartesian product of path and cycle, 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, Linear and cyclic distance-three labellings of trees, 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, Multiple \(L(j,1)\)-labeling of the triangular lattice, Circular \(L(j,k)\)-labeling number of direct product of path and cycle, 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