Abstract: Skolem sequences and Skolem labeled graphs have been described and examined for several decades. This note explores weak Skolem labelling of cycle graphs, which we call Skolem circles. The relationship between Skolem sequences and Skolem cirlces is explored, and Skolem circles of small sizes are enumerated, with some loose general bounds established.
Recommendations
Cited in
(7)- Combinatorial questions: how can graph labelling help?
- Pseudo-Skolem sequences and graph Skolem labelling
- Skolem number of cycles and grid graphs
- scientific article; zbMATH DE number 4138739 (Why is no real title available?)
- Skolem Machines
- Skolem labellings of generalised Dutch windmills
- Skolem number of subgraphs on the triangular lattice
This page was built for publication: Skolem circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5235973)