On antimagic directed graphs
From MaRDI portal
Recommendations
Cites work
- A dynamic survey of graph labeling
- An application of the combinatorial nullstellensatz to a graph labelling problem
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Dense graphs are antimagic
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- On zero-sum partitions and anti-magic trees
- Regular bipartite graphs are antimagic
Cited in
(36)- Tree-antimagicness of disconnected graphs
- Antimagic orientation of biregular bipartite graphs
- Lexicographic product graphs \(P_m[P_n]\) are antimagic
- Local antimagic orientations of \(d\)-degenerate graphs
- Partially magic labelings and the antimagic graph conjecture
- Antimagic orientation of lobsters
- Antimagic orientations of graphs with large maximum degree
- Antimagicness of generalized corona and snowflake graphs
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Antimagic labeling of biregular bipartite graphs
- Local antimagic orientation of graphs
- Caterpillars are antimagic
- Antimagic orientations for the complete \(k\)-ary trees
- Antimagic orientations of disconnected even regular graphs
- A note on antimagic orientations of even regular graphs
- Antimagic orientation of Halin graphs
- Antimagic orientations of graphs with given independence number
- Dense graphs are antimagic
- On antimagic labeling of regular graphs with particular factors
- Weighted-1-antimagic graphs of prime power order
- scientific article; zbMATH DE number 894700 (Why is no real title available?)
- List-antimagic labeling of vertex-weighted graphs
- Note on in-antimagicness and out-antimagicness of digraphs
- Antimagic labeling of digraphs
- Orientable Zn-distance magic regular graphs
- scientific article; zbMATH DE number 7593805 (Why is no real title available?)
- Antimagic orientation of graphs with minimum degree at least 33
- Antimagic orientation of forests
- Graph antimagic labeling: a survey
- On vertex in-out-antimagic total digraphs
- Construction for antimagic generalized web graphs
- Every graph is homeomorphic to an antimagic bipartite graph
- Antimagic labeling for subdivisions of graphs
- The antimagic orientations for graphs obtained by some graph operations
- Antimagic labeling of subdivided caterpillars
- Antimagic orientation of subdivided caterpillars
This page was built for publication: On antimagic directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055919)
