Handicap distance antimagic graphs and incomplete tournaments

Recommendations

Regular incomplete tournaments with handicap two
Handicap incomplete tournaments and ordered distance antimagic graphs
A note on incomplete regular tournaments with handicap two of order \(n\equiv 8 \pmod{16}\)
Full spectrum of regular incomplete 2-handicap tournaments of order \(n \equiv 0 \pmod{16}\)
Regular handicap tournaments of high degree

Cited in

(29)

On regular handicap graphs of even order
Bimagic vertex labelings
Combinatorial configurations in the definition of antimagic labelings of graphs
A magic rectangle set on abelian groups and its application
Distance magic Cartesian products of graphs
A \(\Gamma \)-magic rectangle set and group distance magic labeling
Some results on (a,d)-distance antimagic labeling
A note on incomplete regular tournaments with handicap two of order \(n\equiv 8 \pmod{16}\)
On distance labelings of 2-regular graphs
On regular handicap graphs of order \(n \equiv 0\pmod 8\)
Union of distance magic graphs
Regular handicap graphs of order \(n \equiv 4 \pmod 8\)
\((a,d)\)-distance antimagic labeling of some types of graphs
Regular handicap tournaments of high degree
Handicap incomplete tournaments and ordered distance antimagic graphs
Magic partially filled arrays on abelian groups
Constant and nearly constant block-sum partially balanced incomplete block designs and magic rectangles
Quasimagic rectangles
Local distance antimagic chromatic number for the union of star and double star graphs
Local distance antimagic chromatic number for the union of complete bipartite graphs
On D-distance (anti)magic labelings of shadow graph of some graphs
Existence of magic rectangle sets over finite abelian groups
Tournament design: a review from an operational research perspective
Beyond leagues: a single incomplete round Robin tournament for multi-league sports timetabling
Zero-sum partitions of abelian groups and their applications to magic- and antimagic-type labelings
Partition of abelian groups into zero-sum sets by complete mappings and its application to the existence of a magic rectangle set
On a conjecture by Sylwia Cichacz and Tomasz Hinc, and a related problem
On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs
Break minimization in incomplete round-Robin tournaments

This page was built for publication: Handicap distance antimagic graphs and incomplete tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443440)