Zobrazeno 81 - 90
of 112
pro vyhledávání: '"Victor Neumann"'
Publikováno v:
The History of Political Thought in National Context
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c0f18e7a9a5c732f758388176aad787
https://doi.org/10.1017/cbo9780511521317.013
https://doi.org/10.1017/cbo9780511521317.013
Publikováno v:
Symposium on Computational Geometry
It is known that any family Pn of n points on the plane contains two elements such that any circle containing them contains *elements of Pn. We prove: Let @be a family of n disjoint compact convex sets on the plane, S be a strictly convex compact set
Autor:
Victor Neumann
Publikováno v:
Nationalities Papers. 30:291-292
Publikováno v:
Discussiones Mathematicae Graph Theory. 24:73
Publikováno v:
Discussiones Mathematicae Graph Theory. 24:115
If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E (G)| ≥ 2 |C| − 2.
Autor:
Victor Neumann-Lara
Publikováno v:
Discussiones Mathematicae Graph Theory. 20:197
Publikováno v:
Discussiones Mathematicae Graph Theory. 18:85
Publikováno v:
Discussiones Mathematicae Graph Theory. 16:5
Publikováno v:
Discrete Mathematics. 48:67-76
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D) − N there exists an arc from w to N. If every induced subdigraph of D has a kernel, D is said to be an R-digraph. Minimal non-R-digraphs are called R−
Publikováno v:
Discrete Mathematics. 59:257-265
In this paper we investigate new sufficient conditions for a digraph to be kernel-perfect (KP) and some structural properties of kernel-perfect critical (KPC) digraphs. In particular, it is proved that the asymmetrical part of any KPC digraph is stro