On regular handicap graphs of even order

DOI10.1016/J.ENDM.2017.06.010zbMath1377.05169OpenAlexW2726359666MaRDI QIDQ1687843

Bohumil Krajc, Adam Silber, Tereza Kovářová, Petr Kovář, Aaron Shepanik, Dalibor Fronček, Michal Kravčenko

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.010

zbMATH Keywords

regular graphsgraph labelinghandicap labeling

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Regular handicap graphs of order n ≡ 4 (mod 8) ⋮ On regular handicap graphs of even order ⋮ On regular d-handicap tournaments ⋮ A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) ⋮ Regular handicap graphs of order $n \equiv 0$ (mod 8)

Cites Work

• On regular handicap graphs of even order
• Handicap distance antimagic graphs and incomplete tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On regular handicap graphs of even order