22 citations · 31 across the 3 of their papers we have counts for
4 papers
Cycle lengths modulo in large 3-connected cubic graphs
Kasper S. Lyngsie, Martin Merker
We prove that for all natural numbers and where is odd, there exists a natural number such that any 3-connected cubic graph with at least vertices contain…
Spanning trees without adjacent vertices of degree 2
Kasper Szabo Lyngsie, Martin Merker
Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that there exist highly connected graphs in which every spanning tree contains vertices of degree 2. Using a result of A…
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie
This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights to the edges of any given graph (with no comp…
On neighbour sum-distinguishing -edge-weightings of bipartite graphs
Kasper Szabo Lyngsie
Let be a set of integers. A graph G is said to have the S-property if there exists an S-edge-weighting such that any two adjacent vertices have differe…