Pages that link to "Item:Q1613673"
From MaRDI portal
The following pages link to Coloring mixed hypergraphs: theory, algorithms and applications (Q1613673):
Displayed 50 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)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs (Q394316) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- The chromatic spectrum of 3-uniform bi-hypergraphs (Q409398) (← links)
- The smallest one-realization of a given set. II. (Q449141) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind (Q723786) (← links)
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum (Q726653) (← links)
- The smallest one-realization of a given set. III (Q742599) (← links)
- On Voloshin colorings in 3-hypergraph designs (Q785831) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- Selective hypergraph colourings (Q906467) (← links)
- On a heterochromatic number for hypercubes (Q932668) (← links)
- Smallest set-transversals of \(k\)-partitions (Q968226) (← links)
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees (Q968415) (← links)
- Orderings of uniquely colorable hypergraphs (Q997065) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Color-bounded hypergraphs. I: General results (Q1044919) (← 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)
- Colouring 4-cycle systems with equitably coloured blocks (Q1876682) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
- On the balanced upper chromatic number of finite projective planes (Q2222963) (← links)
- On the spectrum of hypergraphs (Q2229474) (← links)
- Constrained colouring and \(\sigma\)-hypergraphs (Q2259578) (← links)
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs (Q2341713) (← links)
- The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs (Q2343999) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983) (← links)
- \(F\)-WORM colorings: results for 2-connected graphs (Q2403800) (← links)
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set (Q2409524) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- On some colouring of 4-cycle systems with specified block colour patterns (Q2468033) (← links)
- Uniform mixed hypergraphs: the possible numbers of colors (Q2482347) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- Circular mixed hypergraphs. II: The upper chromatic number (Q2495897) (← links)
- Chromatic polynomials of mixed hypercycles (Q2509543) (← links)
- The smallest one-realization of a given set. IV (Q2514158) (← links)
- On the balanced upper chromatic number of cyclic projective planes and projective spaces (Q2515603) (← links)
- Equitably Colored Balanced Incomplete Block Designs (Q2816378) (← links)
- Minimal vertex separators and new characterizations for dually chordal graphs (Q2840528) (← links)
- C-perfect hypergraphs (Q3055910) (← links)
- Mixed colorings of hypergraphs (Q3439449) (← links)
- Mixed hypergraphs and beyond (Q5198021) (← links)