On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture J Bensmail, M Senhaji, KS Lyngsie
Discrete Mathematics & Theoretical Computer Science 19 (Graph Theory), 2017
52 2017 On neighbour sum-distinguishing -edge-weightings of bipartite graphs KS Lyngsie
Discrete Mathematics & Theoretical Computer Science 20 (Graph Theory), 2018
15 2018 On {}-Edge-Weightings of Bipartite Graphs with Odd J Bensmail, F Mc Inerney, KS Lyngsie
Discussiones Mathematicae Graph Theory 42 (1), 159-185, 2022
9 2022 1-2-3 Conjecture in digraphs: More results and directions J Bensmail, K Lyngsie
Discrete Applied Mathematics 284, 124-137, 2020
6 2020 Decomposing graphs into a spanning tree, an even graph, and a star forest KS Lyngsie, M Merker
The Electronic Journal of Combinatorics, P1. 33-P1. 33, 2019
5 2019 Cycle lengths modulo in large 3-connected cubic graphs KS Lyngsie, M Merker
arXiv preprint arXiv:1904.05076, 2019
4 2019 A Generalized Version of a Local Antimagic Labelling Conjecture KS Lyngsie, L Zhong
Graphs and Combinatorics 34, 1363-1369, 2018
4 2018 Vertex colouring edge weightings: A logarithmic upper bound on weight-choosability KS Lyngsie, L Zhong
Electronic Journal of Combinatorics 28 (2), P2. 11, 2021
3 2021 Spanning trees without adjacent vertices of degree 2 KS Lyngsie, M Merker
Discrete Mathematics 342 (12), 111604, 2019
1 2019 Edge-Weightings of Graphs and Applications of Non-Separating Cycles KS Lyngsie
Technical University of Denmark, 2019
2019