Regular bipartite graphs are antimagic
From MaRDI portal
Publication:3608318
DOI10.1002/jgt.20347zbMath1210.05141OpenAlexW4235475206MaRDI QIDQ3608318
Publication date: 4 March 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20347
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (41)
Weighted antimagic labeling: an algorithmic approach ⋮ Antimagic Labeling of Regular Graphs ⋮ Antimagic labeling of some biregular bipartite graphs ⋮ A new class of antimagic join graphs ⋮ Multi-bridge graphs are anti-magic ⋮ Antimagic orientations of graphs with given independence number ⋮ Local antimagic orientation of graphs ⋮ Antimagic orientation of biregular bipartite graphs ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive integers ⋮ Regular Graphs of Odd Degree Are Antimagic ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive numbers ⋮ On antimagic labeling of regular graphs with particular factors ⋮ Antimagic orientation of graphs with minimum degree at least 33 ⋮ Antimagic orientation of forests ⋮ Local antimagic labeling of graphs ⋮ Approaches that output infinitely many graphs with small local antimagic chromatic number ⋮ A class of antimagic join graphs ⋮ Antimagic labeling for unions of graphs with many three-paths ⋮ Antimagic labeling of generalized pyramid graphs ⋮ Unnamed Item ⋮ Caterpillars are antimagic ⋮ On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs ⋮ On Antimagic Labeling for Generalized Web and Flower Graphs ⋮ Weighted antimagic labeling ⋮ Approximate results for rainbow labelings ⋮ Antimagic Properties of Graphs with Large Maximum Degree ⋮ Caterpillars with maximum degree 3 are antimagic ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Antimagic orientations of graphs with large maximum degree ⋮ Antimagic labelings of caterpillars ⋮ On antimagic directed graphs ⋮ An Application of the combinatorial Nullstellensatz to a graph labelling problem ⋮ Antimagic orientations for the complete \(k\)-ary trees ⋮ Antimagic labeling and canonical decomposition of graphs ⋮ Graphs of Large Linear Size Are Antimagic ⋮ Antimagic labelings of join graphs ⋮ Shifted-antimagic labelings for graphs ⋮ Antimagic orientations of disconnected even regular graphs ⋮ Antimagic orientation of Halin graphs ⋮ Antimagic Labeling of Cubic Graphs ⋮ Antimagic labeling of biregular bipartite graphs
Cites Work
This page was built for publication: Regular bipartite graphs are antimagic
