Pages that link to "Item:Q1883629"
From MaRDI portal
The following pages link to On feasible sets of mixed hypergraphs (Q1883629):
Displaying 24 items.
- Spectrum of mixed bi-uniform hypergraphs (Q292241) (← links)
- On perfection and imperfection of one-realizations of a given set (Q294527) (← links)
- More result on the smallest one-realization of a given set (Q295272) (← links)
- Maximum number of colors in hypertrees of bounded degree (Q302137) (← links)
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs (Q394316) (← links)
- The chromatic spectrum of 3-uniform bi-hypergraphs (Q409398) (← links)
- The smallest one-realization of a given set. II. (Q449141) (← links)
- The smallest one-realization of a given set. III (Q742599) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees (Q968415) (← links)
- Color-bounded hypergraphs. I: General results (Q1044919) (← links)
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees (Q1045172) (← links)
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245) (← links)
- On the structure of uniform one-realizations of a given set (Q1706427) (← links)
- More results on the smallest one-realization of a given set. II (Q1717199) (← links)
- The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs (Q2343999) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set (Q2409524) (← links)
- Uniform mixed hypergraphs: the possible numbers of colors (Q2482347) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- The smallest one-realization of a given set. IV (Q2514158) (← links)
- Mixed hypergraphs and beyond (Q5198021) (← links)
- ℱ-WORM colorings of some 2-trees: partition vectors (Q5225032) (← links)
- On planar mixed hypergraphs (Q5948492) (← links)