4 citations · 13 across the 14 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 2 cited
The complement of a nIL graph with thirteen vertices is IL
Andrei Pavelescu, Elena Pavelescu
We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.
math.GT2018
Escher squares and lattice links
Ramin Naimi, Andrei Pavelescu, Elena Pavelescu
We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.
math.CO2018
Hadwiger numbers of self-complementary graphs
Andrei Pavelescu, Elena Pavelescu
The Hadwiger number of a graph , denoted by , is the order of the largest complete minor of . A graph is said to be self-complementary if it is isomorphic to its comple…