Pages that link to "Item:Q3608318"
From MaRDI portal
The following pages link to Regular bipartite graphs are antimagic (Q3608318):
Displaying 40 items.
- Weighted antimagic labeling: an algorithmic approach (Q324749) (← links)
- On antimagic labeling of regular graphs with particular factors (Q396690) (← links)
- Approximate results for rainbow labelings (Q524169) (← links)
- Construction of antimagic labeling for the Cartesian product of regular graphs (Q691635) (← links)
- Antimagic labeling and canonical decomposition of graphs (Q991774) (← links)
- Antimagic orientation of biregular bipartite graphs (Q1676793) (← links)
- Weighted antimagic labeling (Q1752499) (← links)
- A class of antimagic join graphs (Q1949669) (← 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 biregular bipartite graphs (Q2112650) (← links)
- Antimagic labeling of some biregular bipartite graphs (Q2158199) (← 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)
- 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 labeling of generalized pyramid graphs (Q2440477) (← links)
- Antimagic labelings of join graphs (Q2516495) (← links)
- Antimagic orientations of graphs with given independence number (Q2659069) (← links)
- Antimagic labeling for unions of graphs with many three-paths (Q2699924) (← links)
- Graphs of Large Linear Size Are Antimagic (Q2800541) (← links)
- Antimagic Labeling of Cubic Graphs (Q2874087) (← links)
- A new class of antimagic join graphs (Q2927293) (← links)
- Regular Graphs of Odd Degree Are Antimagic (Q2947855) (← links)
- On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs (Q3000511) (← links)
- On Antimagic Labeling for Generalized Web and Flower Graphs (Q3000518) (← 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)
- Antimagic Properties of Graphs with Large Maximum Degree (Q4916097) (← 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)
- Approaches that output infinitely many graphs with small local antimagic chromatic number (Q6174162) (← links)
