May 6, 2015 � A mixed hypergraph H is a one-realization of S if its feasible set is S and each entry of its chromatic spectrum is either 0 or 1.

Jun 4, 2013 � Title:The smallest one-realization of a given set IV. Authors:Kefeng Diao, Vitaly I. Voloshin, Kaishun Wang, Ping Zhao. View a PDF of the�...

Let S be a finite set of positive integers. A mixed hypergraph H is a one-realization of S if its feasible set is S and each entry of its chromatic spectrum�...

Abstract An oriented graph is a directed graph without directed 2-cycles. Poljak and Turz�k (1986) proved that every connected oriented graph G on n�...

Let S be a finite set of positive integers. A mixed hypergraph H is a one-realization of S if its feasible set is S and each entry of its chromatic spectrum�...

Let $S$ be a finite set of positive integers. A mixed hypergraph ${\cal H}$ is a one-realization of $S$ if its feasible set is $S$ and each entry of its�...

The smallest one-realization of a given set IV. Let S be a finite set of positive integers. A mixed hypergraph H is a one-realization of S if its feasible set�...

For any set S of positive integers, a mixed hypergraph H is a one-realization of S if its feasible set is S and each entry of its chromatic spectrum is�...

Let S be a finite set of positive integers. A color-bounded hypergraph is a one-realization of S if its feasible set is S and each entry of its chromatic�...

Intraosseous (IO) vascular access refers to the placement of a specialized hollow bore needle through the cortex of a bone into the medullary space for�...