![]() | ![]() |
2007 | ||
---|---|---|
7 | EE | Ewa Drgas-Burchardt, Ewa Lazuka: Chromatic polynomials of hypergraphs. Appl. Math. Lett. 20(12): 1250-1254 (2007) |
6 | EE | Ewa Drgas-Burchardt, Anna Fiedorowicz: Cost colourings of hypergraphs. Discrete Mathematics 307(11-12): 1298-1305 (2007) |
2006 | ||
5 | EE | Ewa Drgas-Burchardt, Ewa Lazuka: On chromatic polynomials of hypergraphs. Electronic Notes in Discrete Mathematics 24: 105-110 (2006) |
4 | EE | Ewa Drgas-Burchardt: On k-chromatically unique and k-chromatically equivalent hypergraphs. Electronic Notes in Discrete Mathematics 24: 57-60 (2006) |
2004 | ||
3 | EE | Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Peter Mihók: Minimal vertex Ramsey graphs and minimal forbidden subgraphs. Discrete Mathematics 286(1-2): 31-36 (2004) |
1993 | ||
2 | EE | Mieczyslaw Borowiecki, Ewa Drgas-Burchardt: Classes of chromatically unique graphs. Discrete Mathematics 111(1-3): 71-75 (1993) |
1 | EE | Mieczyslaw Borowiecki, Ewa Drgas-Burchardt: Classes of chromatically unique or equivalent graphs. Discrete Mathematics 121(1-3): 11-18 (1993) |
1 | Marta Borowiecka-Olszewska | [3] |
2 | Mieczyslaw Borowiecki | [1] [2] |
3 | Anna Fiedorowicz | [6] |
4 | Ewa Lazuka | [5] [7] |
5 | Peter Mihók | [3] |