Regular bipartite graphs are antimagic

DOI10.1002/JGT.20347MaRDI QIDQ3608318zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Dense graphs are antimagic

Cited in

(48)

• On antimagic labeling of regular graphs with particular factors
• A class of antimagic join graphs
• Antimagic labeling and canonical decomposition of graphs
• On local antimagic chromatic number of cycle-related join graphs. II
• Construction of antimagic labeling for the Cartesian product of regular graphs
• Antimagic orientation of graphs with minimum degree at least 33
• Antimagic labeling of biregular bipartite graphs
• Every graph is homeomorphic to an antimagic bipartite graph
• Caterpillars with maximum degree 3 are antimagic
• Antimagic labelings of caterpillars
• scientific article; zbMATH DE number 7593805 (Why is no real title available?)
• 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
• Antimagic orientations of graphs with large maximum degree
• A new class of antimagic join graphs
• On a relationship between completely separating systems and antimagic labeling of regular graphs
• Antimagic labeling of regular graphs
• Caterpillars are antimagic
• Antimagic orientations for the complete \(k\)-ary trees
• Antifactors of regular bipartite graphs
• Antimagic orientations of disconnected even regular graphs
• Antimagic orientation of Halin graphs
• Antimagic labeling of some biregular bipartite graphs
• On \(k\)-shifted antimagic spider forests
• Approaches that output infinitely many graphs with small local antimagic chromatic number
• Weighted antimagic labeling: an algorithmic approach
• Antimagic orientations of graphs with given independence number
• Shifted-antimagic labelings for graphs
• Graphs of large linear size are antimagic
• 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
• Antimagic labeling for unions of graphs with many three-paths
• Graph antimagic labeling: a survey
• 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)