Variations sur un algorithme de DANTZIG : application à la recherche des plus courts chemins dans les grands réseaux
Variétés complexes compactes : une généralisation de la construction de Meersseman et López de Medrano-Verjovsky
Nous construisons de nouvelles variétés complexes compactes comme espaces d’orbites d’actions linéaires de , généralisant en cela les constructions de Meersseman. Nous donnons également certaines propriétés de ces variétés.
Varieties of operator semigroups representing partitions.
Various Bounds for Liar’s Domination Number
Let G = (V,E) be a graph. A set S ⊆ V is a dominating set if Uv∈S N[v] = V , where N[v] is the closed neighborhood of v. Let L ⊆ V be a dominating set, and let v be a designated vertex in V (an intruder vertex). Each vertex in L ∩ N[v] can report that v is the location of the intruder, but (at most) one x ∈ L ∩ N[v] can report any w ∈ N[x] as the intruder location or x can indicate that there is no intruder in N[x]. A dominating set L is called a liar’s dominating set if every v ∈ V (G) can be correctly...
Various representations of the generalized Kostka polynomials.
Vector spaces and the Petersen graph.
Vector-valued Jack polynomials from scratch.
Venn diagrams and symmetric chain decompositions in the Boolean lattice.
Venn diagrams with few vertices.
Verallgemeinerte Eulersche Zahlen.
Verallgemeinertes Lotschnittaxiom.
Verallgemeinerung der Stirling'schen Zahlen der 2. Art
Vermutungen über numerierbare Graphen.
Verschlüsselungsabbildungen mit Pseudo-Inversen, Zufallsgeneratoren und Täfelungen
Vertauschbarkeit von Partitionen.
Vertex coloring the square of outerplanar graphs of low degree
Vertex colorings of the square of an outerplanar graph have received a lot of attention recently. In this article we prove that the chromatic number of the square of an outerplanar graph of maximum degree Δ = 6 is 7. The optimal upper bound for the chromatic number of the square of an outerplanar graph of maximum degree Δ ≠ 6 is known. Hence, this mentioned chromatic number of 7 is the last and only unknown upper bound of the chromatic number in terms of Δ.
Vertex Colorings without Rainbow Subgraphs
Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G such that there is no rainbow copy of F. We present some results on this parameter for certain graph classes. The focus is on the case that F is a star or triangle. For example, we show that the K3-upper chromatic number of any maximal outerplanar...
Vertex covering with monochromatic paths.
Vertex Cyclic Graphs.
Vertex degree sequences of graphs with small number of circuits.