This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (6)
Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.
The course aims to introduce the basic concepts and results of modern Graph Theory with special emphasis on those topics and techniques that have proved to be applicable in theoretical computer scienc
We consider a wide class of families (Fm)m is an element of N of Gaussian fields on 1Cd = Rd/Zd defined by Fm : x-* 1 _ X p|Am| l lambda ei2 pi lambda is an element of Lambda m where the l lambda's are independent standard normals and Am is the ...
A polyhedral graph is a 3-connected planar graph. We find the least possible order p(k, a) of a polyhedral graph containing a k-independent set of size a for all positive integers k and a. In the case k =1 and a even, we prove that the extremal graphs are ...
A sequence sigma of p non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a 3-connected, planar graph. We investigate which sequences are unigraphic with respect to the class of po ...
