Antimagic labeling of some biregular bipartite graphs
From MaRDI portal
Publication:2158199
DOI10.7151/DMGT.2340zbMATH Open1496.05159OpenAlexW3037800395MaRDI QIDQ2158199FDOQ2158199
Authors: Kecai Deng, Yunfei Li 
Publication date: 26 July 2022
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2340
Recommendations
Cites Work
- A dynamic survey of graph labeling
- Transversal theory. An account of some aspects of combinatorial mathematics
- On zero-sum partitions and anti-magic trees
- Dense graphs are antimagic
- Regular bipartite graphs are antimagic
- Title not available (Why is that?)
- Antimagic labeling of cubic graphs
- Antimagic Labeling of Regular Graphs
- Anti-magic labeling of trees
- Caterpillars are antimagic
- Graphs of large linear size are antimagic
- Regular Graphs of Odd Degree Are Antimagic
- Caterpillars with maximum degree 3 are antimagic
- Antimagic labelings of caterpillars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extension of Hall's theorem and an algorithm for finding the \((1,n)\)-complete matching
Cited In (8)
- On antimagic labeling of regular graphs with particular factors
- Every graph is homeomorphic to an antimagic bipartite graph
- Antimagic labeling of biregular bipartite graphs
- Title not available (Why is that?)
- Regular bipartite graphs are antimagic
- Antimagic orientation of forests
- Antimagic labeling for subdivisions of graphs
- Graph antimagic labeling: a survey
This page was built for publication: Antimagic labeling of some biregular bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158199)
