Pages that link to "Item:Q2947855"
From MaRDI portal
The following pages link to Regular Graphs of Odd Degree Are Antimagic (Q2947855):
Displayed 30 items.
- Regular graphs are antimagic (Q888592) (← links)
- Antimagic orientation of biregular bipartite graphs (Q1676793) (← links)
- Partially magic labelings and the antimagic graph conjecture (Q1745194) (← links)
- Weighted antimagic labeling (Q1752499) (← links)
- A generalized version of a local antimagic labelling conjecture (Q1756104) (← links)
- Caterpillars with maximum degree 3 are antimagic (Q1999746) (← links)
- Antimagic orientations of graphs with large maximum degree (Q2005714) (← links)
- Antimagic labelings of caterpillars (Q2008558) (← links)
- Shifted-antimagic labelings for graphs (Q2045398) (← links)
- Antimagic labeling of forests with sets of consecutive integers (Q2065767) (← links)
- Antimagic labeling of biregular bipartite graphs (Q2112650) (← links)
- Antimagic labeling of some biregular bipartite graphs (Q2158199) (← links)
- A note on additive choice number of planar graphs (Q2172418) (← links)
- Local antimagic orientation of graphs (Q2175055) (← links)
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers (Q2184690) (← links)
- Caterpillars are antimagic (Q2223075) (← links)
- Antimagic orientations for the complete \(k\)-ary trees (Q2279747) (← links)
- Antimagic orientations of disconnected even regular graphs (Q2319719) (← links)
- A note on antimagic orientations of even regular graphs (Q2322893) (← links)
- Antimagic orientation of Halin graphs (Q2324503) (← links)
- Graphs admitting antimagic labeling for arbitrary sets of positive integers (Q2413165) (← links)
- Local antimagic labeling of graphs (Q2423101) (← links)
- Antimagic orientations of graphs with given independence number (Q2659069) (← links)
- Antimagic Labeling of Regular Graphs (Q3188668) (← links)
- List-antimagic labeling of vertex-weighted graphs (Q5024668) (← links)
- Multi-bridge graphs are anti-magic (Q5081233) (← links)
- Antimagic orientation of graphs with minimum degree at least 33 (Q6056766) (← links)
- Antimagic orientation of forests (Q6080125) (← links)
- Generation of anti-magic graphs from binary graph products (Q6138728) (← links)
- Approaches that output infinitely many graphs with small local antimagic chromatic number (Q6174162) (← links)