Marek Tesar

According to our database, Marek Tesar authored at least 8 papers between 2008 and 2017.

Collaborative distances:

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

2017

Rainbow colouring of split graphs.

L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar

Discret. Appl. Math., 2017

2016

Computational complexity of covering three-vertex multigraphs.

Jan Kratochvíl, Jan Arne Telle, Marek Tesar

Theor. Comput. Sci., 2016

2015

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar

Theor. Comput. Sci., 2015

2013

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.

Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil

Graphs Comb., 2013

Dichotomy of the H-Quasi-Cover Problem.

Jirí Fiala, Marek Tesar

Proceedings of the Computer Science - Theory and Applications, 2013

2011

Locally Injective Homomorphism to the Simple Weight Graphs.

Ondrej Bílka, Bernard Lidický, Marek Tesar

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

Complexity of Locally Injective Homomorphism to the Theta Graphs.

Bernard Lidický, Marek Tesar

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2008

Clustered Planarity: Clusters with Few Outgoing Edges.

Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil

Proceedings of the Graph Drawing, 16th International Symposium, 2008