Antimagic labeling of some biregular bipartite graphs
From MaRDI portal
Publication:2158199
Recommendations
Cites work
- scientific article; zbMATH DE number 4132212 (Why is no real title available?)
- scientific article; zbMATH DE number 6537750 (Why is no real title available?)
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- A dynamic survey of graph labeling
- Anti-magic labeling of trees
- Antimagic labeling of cubic graphs
- Antimagic labeling of regular graphs
- Antimagic labelings of caterpillars
- Caterpillars are antimagic
- Caterpillars with maximum degree 3 are antimagic
- Dense graphs are antimagic
- Extension of Hall's theorem and an algorithm for finding the \((1,n)\)-complete matching
- Graphs of large linear size are antimagic
- On zero-sum partitions and anti-magic trees
- Regular bipartite graphs are antimagic
- Regular graphs of odd degree are antimagic
- Transversal theory. An account of some aspects of combinatorial mathematics
Cited in
(8)- Antimagic labeling for subdivisions of graphs
- On antimagic labeling of regular graphs with particular factors
- scientific article; zbMATH DE number 6849636 (Why is no real title available?)
- Antimagic labeling of biregular bipartite graphs
- Graph antimagic labeling: a survey
- Regular bipartite graphs are antimagic
- Antimagic orientation of forests
- Every graph is homeomorphic to an antimagic bipartite graph
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)
