Neighborhoods in line graphs
Neighbourhood realizations of complements of intersection graphs
Non-constant continuous mappings of metric or compact Hausdorff spaces
Note on homomorphism interpolation theorem
Note on Induced Subgraphs of the Unit Distance Graph En.
Note on the number of monoids of order
Note sur le théorème des demi-degrés
Note sur une caractérisation des graphes dont le degré de déséquilibre est maximal
Dans cette note on démontre la conjecture d'Abelson et Rosenberg sur le degré maximal de déséquilibre d'un graphe à n sommets et on caractérise ces graphes maximaux.
Note: The Smallest Nonevasive Graph Property
A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n = 6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs and show that...
Nowhere-zero -flows of supergraphs.
NP-hardness results for intersection graphs