Ondrej Pangrác

According to our database, Ondrej Pangrác authored at least 20 papers between 1999 and 2021.

Collaborative distances:

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

2021

Flexibility of triangle-free planar graphs.

Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác

J. Graph Theory, 2021

2020

Flexibility of planar graphs of girth at least six.

Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác

J. Graph Theory, 2020

2019

Triangle-free planar graphs with the smallest independence number.

Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác

J. Graph Theory, 2019

2012

Coloring Eulerian Triangulations of the Klein Bottle.

Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki

Graphs Comb., 2012

2011

5-Coloring Graphs with 4 Crossings.

Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác

SIAM J. Discret. Math., 2011

2010

Length-bounded cuts and flows.

Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella

ACM Trans. Algorithms, 2010

Markov bases of binary graph models of K₄-minor free graphs.

Daniel Král', Serguei Norine, Ondrej Pangrác

J. Comb. Theory A, 2010

Pattern Hypergraphs.

Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác

Electron. J. Comb., 2010

2009

Projective, affine, and abelian colorings of cubic graphs.

Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera

Eur. J. Comb., 2009

On the complexity of paths avoiding forbidden pairs.

Petr Kolman, Ondrej Pangrác

Discret. Appl. Math., 2009

2006

Perfect Matching Preservers.

Richard A. Brualdi, Martin Loebl, Ondrej Pangrác

Electron. J. Comb., 2006

2005

Locally consistent constraint satisfaction problems.

Zdenek Dvorák, Daniel Král, Ondrej Pangrác

Theor. Comput. Sci., 2005

A note on group colorings.

Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss

J. Graph Theory, 2005

An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.

Daniel Král, Ondrej Pangrác

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Triangles in random graphs.

Martin Loebl, Jirí Matousek, Ondrej Pangrác

Discret. Math., 2004

An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.

Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác

Proceedings of the Algorithm Theory, 2004

Locally Consistent Constraint Satisfaction Problems: (Extended Abstract).

Zdenek Dvorák, Daniel Král, Ondrej Pangrác

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2002

Complexity of Pattern Coloring of Cycle Systems.

Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

On Intersection Graphs of Segments with Prescribed Slopes.

Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác

Proceedings of the Graph Drawing, 9th International Symposium, 2001

1999

Visibility Representations of Complete Graphs.

Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák

Proceedings of the Graph Drawing, 7th International Symposium, 1999