Supermagic graphs with many different degrees
From MaRDI portal
Publication:2042614
DOI10.7151/dmgt.2227zbMath1468.05265OpenAlexW2946873379MaRDI QIDQ2042614
Michal Kravčenko, Petr Kovář, Adam Silber, Matěj Krbeček
Publication date: 21 July 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10084/145231
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- A dynamic survey of graph labeling
- On supermagic regular graphs
- On magic and supermagic line graphs
- Supermagic graphs having a saturated vertex
- Numbers of edges in supermagic graphs
- Magic Graphs
- Supermagic Complete Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Supermagic graphs with many different degrees