Pages that link to "Item:Q1025454"
From MaRDI portal
The following pages link to On zero-sum partitions and anti-magic trees (Q1025454):
Displaying 47 items.
- Group sum chromatic number of graphs (Q268265) (← links)
- Weighted antimagic labeling: an algorithmic approach (Q324749) (← links)
- Anti-magic labeling of trees (Q397133) (← links)
- Weighted-1-antimagic graphs of prime power order (Q432719) (← links)
- Approximate results for rainbow labelings (Q524169) (← links)
- Antimagic orientation of subdivided caterpillars (Q832995) (← links)
- Note on group irregularity strength of disconnected graphs (Q1643408) (← links)
- Antimagic orientation of biregular bipartite graphs (Q1676793) (← links)
- Zero sum partition of abelian groups into sets of the same order and its applications (Q1700783) (← links)
- Lexicographic product graphs \(P_m[P_n]\) are antimagic (Q1713615) (← links)
- Orientable \(\mathbb{Z}_N\)-distance magic graphs (Q1717208) (← links)
- Partially magic labelings and the antimagic graph conjecture (Q1745194) (← links)
- Weighted antimagic labeling (Q1752499) (← links)
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\) (Q1993366) (← links)
- Caterpillars with maximum degree 3 are antimagic (Q1999746) (← links)
- Antimagic orientation of lobsters (Q2004070) (← links)
- Antimagic labelings of caterpillars (Q2008558) (← links)
- Antimagicness of lexicographic product graph \(G[P_n]\) (Q2023731) (← links)
- Shifted-antimagic labelings for graphs (Q2045398) (← links)
- Product antimagic labeling of caterpillars (Q2051631) (← links)
- Antimagic labeling of forests with sets of consecutive integers (Q2065767) (← links)
- Trees whose even-degree vertices induce a path are antimagic (Q2151224) (← links)
- Antimagic labeling of some biregular bipartite graphs (Q2158199) (← links)
- Caterpillars are antimagic (Q2223075) (← links)
- Antimagic orientation of Halin graphs (Q2324503) (← links)
- Group irregularity strength of connected graphs (Q2352344) (← links)
- Note on group distance magic complete bipartite graphs (Q2440565) (← links)
- Antimagic orientations of graphs with given independence number (Q2659069) (← links)
- Antimagic labeling for unions of graphs with many three-paths (Q2699924) (← links)
- Antimagic Labeling of Cubic Graphs (Q2874087) (← links)
- Antimagic labelling of vertex weighted graphs (Q2897212) (← links)
- On antimagic directed graphs (Q3055919) (← links)
- An Application of the combinatorial Nullstellensatz to a graph labelling problem (Q3055927) (← links)
- Antimagic Labeling of Regular Graphs (Q3188668) (← links)
- On zero sum-partition of Abelian groups into three sets and group distance magic labeling (Q4604530) (← links)
- Antimagic labeling of new classes of trees (Q5016222) (← links)
- Multi-bridge graphs are anti-magic (Q5081233) (← links)
- On constant sum partitions and applications to distance magic-type graphs (Q5154601) (← links)
- Symmetric complete sum-free sets in cyclic groups (Q5915549) (← links)
- Antimagic orientation of graphs with minimum degree at least 33 (Q6056766) (← links)
- Antimagic orientation of forests (Q6080125) (← links)
- Realization of digraphs in Abelian groups and its consequences (Q6081565) (← links)
- Labeling trees of small diameters with consecutive integers (Q6110572) (← links)
- Generation of anti-magic graphs from binary graph products (Q6138728) (← links)
- Graph antimagic labeling: a survey (Q6542943) (← links)
- Every graph is homeomorphic to an antimagic bipartite graph (Q6564831) (← links)
- On \(k\)-shifted antimagic spider forests (Q6611091) (← links)