Jana Maxová

According to our database, Jana Maxová authored at least 13 papers between 2000 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

An automated platform for assembling light-powered hydrogel microrobots and their subsequent chemical binding.

Jan Vrba, Charlie Maslen, Jana Maxová, Jan Duras, Ivan Rehor, Jan Mares

J. Comput. Sci., 2021

2019

Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets.

Jan Bok, Jana Maxová

Order, 2019

A relaxed version of Šoltés's problem and cactus graphs.

Jan Bok, Nikola Jedlicková, Jana Maxová

CoRR, 2019

2014

Which k-trees are cover-incomparability graphs?

Jana Maxová, Miroslava Dubcová, Pavla Pavlíková, Daniel Turzík

Discret. Appl. Math., 2014

2013

Which distance-hereditary graphs are cover-incomparability graphs?

Jana Maxová, Daniel Turzík

Discret. Appl. Math., 2013

2009

On the Complexity of Cover-Incomparability Graphs of Posets.

Jana Maxová, Pavla Pavlíková, Daniel Turzík

Order, 2009

2006

Cantor-Bernstein type theorem for locally constrained graph homomorphisms.

Jirí Fiala, Jana Maxová

Eur. J. Comb., 2006

2005

Hamilton cycles in strong products of graphs.

Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský

J. Graph Theory, 2005

2004

Pancyclicity of Strong Products of Graphs.

Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal

Graphs Comb., 2004

2003

Low-Distortion Embeddings of Trees.

Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr

J. Graph Algorithms Appl., 2003

2002

Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations.

Jana Maxová, Jaroslav Nesetril

Proceedings of the Algorithms, 2002

2001

On oriented path double covers.

Jana Maxová, Jaroslav Nesetril

Discret. Math., 2001

2000

On covers of graphs.

Jana Maxová, Jaroslav Nesetril

Electron. Notes Discret. Math., 2000