The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 6 of 6

Showing per page

Order by Relevance | Title | Year of publication

On automatic boundedness of Nemytskiĭ set-valued operators

S. RolewiczWen Song — 1995

Studia Mathematica

Let X, Y be two separable F-spaces. Let (Ω,Σ,μ) be a measure space with μ complete, non-atomic and σ-finite. Let N F be the Nemytskiĭ set-valued operator induced by a sup-measurable set-valued function F : Ω × X 2 Y . It is shown that if N F maps a modular space ( N ( L ( Ω , Σ , μ ; X ) ) , ϱ N , μ ) into subsets of a modular space ( M ( L ( Ω , Σ , μ ; Y ) ) , ϱ M , μ ) , then N F is automatically modular bounded, i.e. for each set K ⊂ N(L(Ω,Σ,μ;X)) such that r K = s u p ϱ N , μ ( x ) : x K < we have s u p ϱ M , μ ( y ) : y N F ( K ) < .

Duality in set-valued optimization

Song Wen — 1998

CONTENTSIntroduction...........................................................................................................51. Preliminaries on convex and set-valued analysis..............................................6 1.1. Convexity of sets...........................................................................................6 1.2. Convexity of set-valued mappings.................................................................9 1.3. Closed convex processes and invex set-valued mappings..........................122....

Strong Edge-Coloring Of Planar Graphs

Wen-Yao SongLian-Ying Miao — 2017

Discussiones Mathematicae Graph Theory

A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known that every planar graph G has a strong edge-coloring with at most 4 Δ(G) + 4 colors [R.J. Faudree, A. Gyárfás, R.H. Schelp and Zs. Tuza, The strong chromatic index of graphs, Ars Combin. 29B (1990) 205–211]. In this paper, we show that if G is...

Page 1

Download Results (CSV)