On regular handicap graphs of even order

DOI10.1016/J.ENDM.2017.06.010MaRDI QIDQ1687843zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Regular handicap graphs of odd order
• Regular handicap graphs of order \(n \equiv 4 \pmod 8\)
• On regular handicap graphs of order \(n \equiv 0\pmod 8\)
• Regular handicap tournaments of high degree
• Full spectrum of regular incomplete 2-handicap tournaments of order \(n \equiv 0 \pmod{16}\)

Cites work

• scientific article; zbMATH DE number 6273983 (Why is no real title available?)
• Handicap distance antimagic graphs and incomplete tournaments
• Handicap incomplete tournaments and ordered distance antimagic graphs
• On regular handicap graphs of even order
• Regular handicap graphs of odd order
• Regular handicap tournaments of high degree

Cited in

(6)

• scientific article; zbMATH DE number 6938300 (Why is no real title available?)
• On regular d-handicap tournaments
• Regular handicap graphs of order \(n \equiv 4 \pmod 8\)
• On regular handicap graphs of order \(n \equiv 0\pmod 8\)
• A note on incomplete regular tournaments with handicap two of order \(n\equiv 8 \pmod{16}\)
• On regular handicap graphs of even order

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

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