Regular handicap graphs of order $n \equiv 0$ (mod 8)

DOI10.5614/ejgta.2018.6.2.1zbMath1467.05223OpenAlexW2897498243MaRDI QIDQ5009981

Aaron Shepanik, Dalibor Fronček

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2018.6.2.1

zbMATH Keywords

regular graphsgraph labelinghandicap labelingtournament scheduling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Regular handicap graphs of order n ≡ 4 (mod 8) ⋮ On regular d-handicap tournaments ⋮ On distance labelings of 2-regular graphs

Cites Work

• On regular handicap graphs of even order
• Handicap distance antimagic graphs and incomplete tournaments
• The chromatic index of complete multipartite graphs
• A note on incomplete regular tournaments with handicap two of order n≡8(mod 16)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular handicap graphs of order $n \equiv 0$ (mod 8)