Computing and Combinatorics
From MaRDI portal
Publication:5716988
DOI10.1007/11533719zbMath1128.05311OpenAlexW4376561447MaRDI QIDQ5716988
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Related Items (25)
On edge-graceful labeling and deficiency for regular graphs ⋮ Weighted antimagic labeling: an algorithmic approach ⋮ Multi-bridge graphs are anti-magic ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive integers ⋮ On edge-graceful regular graphs with particular 3-factors ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive numbers ⋮ On antimagic labeling of regular graphs with particular factors ⋮ Weighted-1-antimagic graphs of prime power order ⋮ Antimagic labeling of generalized pyramid graphs ⋮ Unnamed Item ⋮ Caterpillars are antimagic ⋮ On anti-magic labeling for graph products ⋮ On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs ⋮ C_4-face-magic toroidal labelings on C_m × C_n ⋮ Weighted antimagic labeling ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Antimagic labelings of caterpillars ⋮ Labelings of plane graphs containing Hamilton path ⋮ Unnamed Item ⋮ Antimagic labeling and canonical decomposition of graphs ⋮ A new class of antimagic Cartesian product graphs ⋮ The antimagicness of the Cartesian product of graphs ⋮ Shifted-antimagic labelings for graphs ⋮ Lattice grids and prisms are antimagic ⋮ Antimagic labeling of forests with sets of consecutive integers
This page was built for publication: Computing and Combinatorics
