Antimagic labeling of some biregular bipartite graphs

DOI10.7151/DMGT.2340zbMATH Open1496.05159OpenAlexW3037800395MaRDI QIDQ2158199FDOQ2158199

Yunfei Li, Kecai Deng

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

zbMATH Keywords

bipartiteantimagic labelingbiregular

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• 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

Cited In (6)

• On antimagic labeling of regular graphs with particular factors
• Every graph is homeomorphic to an antimagic bipartite graph
• Title not available (Why is that?)
• 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)