Regular bipartite graphs are antimagic
From MaRDI portal
Publication:3608318
Recommendations
Cites work
Cited in
(52)- Antimagic orientation of biregular bipartite graphs
- Partially magic labelings and the antimagic graph conjecture
- Weighted antimagic labeling
- A class of antimagic join graphs
- Caterpillars with maximum degree 3 are antimagic
- Antimagic orientations of graphs with large maximum degree
- Antimagic labelings of caterpillars
- Shifted-antimagic labelings for graphs
- Antimagic labeling of biregular bipartite graphs
- Antimagic labeling of some biregular bipartite graphs
- Local antimagic orientation of graphs
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers
- Caterpillars are antimagic
- Antimagic orientations for the complete \(k\)-ary trees
- Antimagic orientations of disconnected even regular graphs
- Antimagic orientation of Halin graphs
- Graphs admitting antimagic labeling for arbitrary sets of positive integers
- Local antimagic labeling of graphs
- Antimagic labeling of generalized pyramid graphs
- Antimagic labelings of join graphs
- Antimagic orientations of graphs with given independence number
- Antimagic labeling for unions of graphs with many three-paths
- Graphs of large linear size are antimagic
- Antimagic labeling of cubic graphs
- A new class of antimagic join graphs
- Regular graphs of odd degree are antimagic
- On a relationship between completely separating systems and antimagic labeling of regular graphs
- On antimagic labeling for generalized web and flower graphs
- On antimagic directed graphs
- An application of the combinatorial nullstellensatz to a graph labelling problem
- Antimagic labeling of regular graphs
- Weighted antimagic labeling: an algorithmic approach
- Antifactors of regular bipartite graphs
- On antimagic labeling of regular graphs with particular factors
- Antimagic properties of graphs with large maximum degree
- Multi-bridge graphs are anti-magic
- Approximate results for rainbow labelings
- scientific article; zbMATH DE number 7593805 (Why is no real title available?)
- Antimagic orientation of graphs with minimum degree at least 33
- Antimagic orientation of forests
- Approaches that output infinitely many graphs with small local antimagic chromatic number
- Antimagic labeling of forests
- Graph antimagic labeling: a survey
- On local antimagic chromatic number of cycle-related join graphs. II
- Every graph is homeomorphic to an antimagic bipartite graph
- On \(k\)-shifted antimagic spider forests
- D-antimagic labelings arising from completely separating systems
- Construction of antimagic labeling for the Cartesian product of regular graphs
- The vertex local antimagicness for Knödel and Fibonacci graphs
- On the study of rainbow antimagic connection number of comb product of tree and complete bipartite graph
- Antimagic labeling of subdivided caterpillars
- Antimagic labeling and canonical decomposition of graphs
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)
