 | 2009 |
|---|
| 10 |       | Jana Maxová,
Pavla Pavlíková,
Daniel Turzík:
On the Complexity of Cover-Incomparability Graphs of Posets.
Order 26(3): 229-236 (2009) |
| 2006 |
|---|
| 9 | | Jirí Fiala,
Jana Maxová:
Cantor-Bernstein type theorem for locally constrained graph homomorphisms.
Eur. J. Comb. 27(7): 1111-1116 (2006) |
| 2005 |
|---|
| 8 | | Daniel Král,
Jana Maxová,
Robert Sámal,
Pavel Podbrdský:
Hamilton cycles in strong products of graphs.
Journal of Graph Theory 48(4): 299-321 (2005) |
| 2004 |
|---|
| 7 | | Jana Maxová,
Jaroslav Nesetril:
On covers of graphs.
Discrete Mathematics 276(1-3): 287-294 (2004) |
| 6 | | Daniel Král,
Jana Maxová,
Pavel Podbrdský,
Robert Sámal:
Pancyclicity of Strong Products of Graphs.
Graphs and Combinatorics 20(1): 91-104 (2004) |
| 2003 |
|---|
| 5 | | Robert Babilon,
Jirí Matousek,
Jana Maxová,
Pavel Valtr:
Low-Distortion Embeddings of Trees.
J. Graph Algorithms Appl. 7(4): 399-409 (2003) |
| 2002 |
|---|
| 4 | | Jana Maxová,
Jaroslav Nesetril:
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations.
ESA 2002: 711-722 |
| 2001 |
|---|
| 3 | | Robert Babilon,
Jirí Matousek,
Jana Maxová,
Pavel Valtr:
Low-Distortion Embeddings of Trees.
Graph Drawing 2001: 343-351 |
| 2 | | Jana Maxová,
Jaroslav Nesetril:
On oriented path double covers.
Discrete Mathematics 233(1-3): 371-380 (2001) |
| 2000 |
|---|
| 1 | | Jana Maxová,
Jaroslav Nesetril:
On covers of graphs.
Electronic Notes in Discrete Mathematics 5: 222-224 (2000) |
Data released under the ODC-BY 1.0 license — See also our legal information page