Regular bipartite graphs are antimagic

DOI10.1002/JGT.20347zbMATH Open1210.05141OpenAlexW4235475206MaRDI QIDQ3608318FDOQ3608318

Authors: Daniel W. Cranston 

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

Recommendations

• Antimagic labeling of biregular bipartite graphs
• Antimagic labeling of some biregular bipartite graphs
• On antimagic labeling of regular graphs with particular factors
• scientific article; zbMATH DE number 6374002
• Antimagic labeling of regular graphs

zbMATH Keywords

bipartite graphgraph decompositionregular graphmarriage theoremantimagic graph labeling

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Dense graphs are antimagic
• Title not available (Why is that?)
• Anti‐magic graphs via the Combinatorial NullStellenSatz

Cited In (48)

• On antimagic labeling of regular graphs with particular factors
• On local antimagic chromatic number of cycle-related join graphs. II
• A class of antimagic join graphs
• Antimagic orientation of graphs with minimum degree at least 33
• Every graph is homeomorphic to an antimagic bipartite graph
• Antimagic labeling and canonical decomposition of graphs
• Construction of antimagic labeling for the Cartesian product of regular graphs
• Antimagic labeling of biregular bipartite graphs
• Title not available (Why is that?)
• Caterpillars with maximum degree 3 are antimagic
• Antimagic labelings of caterpillars
• Antimagic labeling of generalized pyramid graphs
• Antimagic labelings of join graphs
• Local antimagic orientation of graphs
• Partially magic labelings and the antimagic graph conjecture
• Antimagic orientation of biregular bipartite graphs
• On antimagic labeling for generalized web and flower graphs
• Local antimagic labeling of graphs
• A new class of antimagic join graphs
• Antimagic orientations of graphs with large maximum degree
• On a relationship between completely separating systems and antimagic labeling of regular graphs
• Antimagic labeling of regular graphs
• Caterpillars are antimagic
• Antifactors of regular bipartite graphs
• Antimagic orientations for the complete \(k\)-ary trees
• Antimagic orientations of disconnected even regular graphs
• Antimagic orientation of Halin graphs
• On \(k\)-shifted antimagic spider forests
• Antimagic labeling of some biregular bipartite graphs
• Approaches that output infinitely many graphs with small local antimagic chromatic number
• Antimagic orientations of graphs with given independence number
• Weighted antimagic labeling: an algorithmic approach
• Graphs of large linear size are antimagic
• Shifted-antimagic labelings for graphs
• Antimagic orientation of forests
• Antimagic labeling of cubic graphs
• Graphs admitting antimagic labeling for arbitrary sets of positive integers
• On antimagic directed graphs
• Regular graphs of odd degree are antimagic
• Antimagic labeling of forests
• Graphs admitting antimagic labeling for arbitrary sets of positive numbers
• Weighted antimagic labeling
• An application of the combinatorial nullstellensatz to a graph labelling problem
• Antimagic properties of graphs with large maximum degree
• Graph antimagic labeling: a survey
• Antimagic labeling for unions of graphs with many three-paths
• Multi-bridge graphs are anti-magic
• Approximate results for rainbow labelings

This page was built for publication: Regular bipartite graphs are antimagic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608318)