Skolem labelled graphs
From MaRDI portal
This paper deals with so-called \(d\)-Skolem labelled graphs and \(d\)-hooked Skolem labelled graphs. After quoting and representing main results in terms of \(d\)-Skolem labelled graphs the authors prove a lot of new theorems. Most of them give new classes of \(d\)-Skolem labelled graphs. It is also worth to be mentioned that some of the new theorems are proved by means of suitable algorithms.
Recommendations
Cites work
- scientific article; zbMATH DE number 4091564 (Why is no real title available?)
- scientific article; zbMATH DE number 3639635 (Why is no real title available?)
- scientific article; zbMATH DE number 3237887 (Why is no real title available?)
- Langford sequences: Perfect and hooked
- On certain distributions of integers in pairs with given differences
- On Cyclic Steiner 2-Designs
- On Langford’s Problem (II)
- Some Remarks on the Triple Systems of Steiner.
- Verification of a Conjecture of Th. Skolem.
Cited in
(8)- Combinatorial questions: how can graph labelling help?
- Scherk-type capillary graphs
- A survey of Skolem-type sequences and Rosa’s use of them
- Starter labelling of \(k\)-windmill graphs with small defects
- Skolem circles
- Skolem labelled trees and P_s P_t Cartesian products
- scientific article; zbMATH DE number 2188411 (Why is no real title available?)
- Skolem number of subgraphs on the triangular lattice
This page was built for publication: Skolem labelled graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183997)