scientific article
From MaRDI portal
Publication:3410855
zbMath1103.05037MaRDI QIDQ3410855
Petr Kovář, Dalibor Fronček, Tereza Kovářová
Publication date: 16 November 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (13)
Regular handicap graphs of order n ≡ 4 (mod 8) ⋮ Unnamed Item ⋮ Distance magic graphs \(G \times C_n\) ⋮ On regular d-handicap tournaments ⋮ Bimagic vertex labelings ⋮ Distance magic labeling and two products of graphs ⋮ Distance magic circulant graphs ⋮ Union of distance magic graphs ⋮ Some distance magic graphs ⋮ A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) ⋮ March Madness Magic: Constructing a Tournament with a Magic Cube ⋮ Some results on (a,d)-distance antimagic labeling ⋮ Regular handicap graphs of order $n \equiv 0$ (mod 8)
This page was built for publication:
