The following pages link to (Q5477816):
Displaying 22 items.
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- 2-colorings of uniform hypergraphs (Q509176) (← links)
- Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph (Q650517) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- On the chromatic number of finite systems of subsets (Q1034015) (← links)
- A note on panchromatic colorings (Q1690224) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) (← links)
- Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
- On the minimum number of edges in triangle-free 5-critical graphs (Q2403700) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493) (← links)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
