A note on incomplete regular tournaments with handicap two of order n≡8(mod 16)

DOI10.7494/OpMath.2017.37.4.557zbMath1397.05157OpenAlexW2607535084MaRDI QIDQ4690985

Dalibor Fronček

Publication date: 23 October 2018

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2017.37.4.557

zbMATH Keywords

distance magic labelinghandicap labelinghandicap tournamentsincomplete tournaments

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Regular handicap graphs of order n ≡ 4 (mod 8) ⋮ On regular d-handicap tournaments ⋮ Combinatorial configurations in the definition of antimagic labelings of graphs ⋮ Regular handicap graphs of order $n \equiv 0$ (mod 8)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular handicap graphs of even order
• On the existence of magic \(n\)-dimensional rectangles
• Handicap distance antimagic graphs and incomplete tournaments

This page was built for publication: A note on incomplete regular tournaments with handicap two of order n≡8(mod 16)