Antimagic labeling of biregular bipartite graphs
From MaRDI portal
Publication:2112650
DOI10.1016/j.dam.2022.11.019OpenAlexW4311396647MaRDI QIDQ2112650
Publication date: 11 January 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.11.019
Cites Work
- Unnamed Item
- Regular graphs are antimagic
- A dynamic survey of graph labeling
- Antimagic orientation of biregular bipartite graphs
- Antimagic orientation of lobsters
- Antimagic orientations of graphs with large maximum degree
- A note on antimagic orientations of even regular graphs
- Antimagic orientation of Halin graphs
- Graphs of Large Linear Size Are Antimagic
- Graph Theory
- Regular Graphs of Odd Degree Are Antimagic
- On antimagic directed graphs
- Dense graphs are antimagic
- Antimagic Labeling of Regular Graphs
- Regular bipartite graphs are antimagic
- Antimagic Properties of Graphs with Large Maximum Degree
- Antimagic orientations of even regular graphs
This page was built for publication: Antimagic labeling of biregular bipartite graphs