Ondrej Pangrác

24 papers A* 1A 2B 2Journal 18Unranked 1
YearRankTypeTitle / Venue / Authors
2021 J jnl
Flexibility of triangle-free planar graphs.
J. Graph Theory
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2020 J jnl
Flexibility of planar graphs of girth at least six.
J. Graph Theory
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2019 J jnl
Flexibility of planar graphs of girth at least six.
CoRR
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2019 J jnl
Flexibility of triangle-free planar graphs.
CoRR
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2019 J jnl
Triangle-free planar graphs with the smallest independence number.
J. Graph Theory
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2016 J jnl
Triangle-free planar graphs with the smallest independence number.
CoRR
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2012 J jnl
Coloring Eulerian Triangulations of the Klein Bottle.
Graphs Comb.
Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki
2011 J jnl
5-Coloring Graphs with 4 Crossings.
SIAM J. Discret. Math.
Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác
2010 J jnl
Length-bounded cuts and flows.
ACM Trans. Algorithms
Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella
2010 J jnl
Markov bases of binary graph models of K
J. Comb. Theory A
Daniel Král', Serguei Norine, Ondrej Pangrác
2010 J jnl
Pattern Hypergraphs.
Electron. J. Comb.
Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác
2009 J jnl
On the complexity of paths avoiding forbidden pairs.
Discret. Appl. Math.
Petr Kolman, Ondrej Pangrác
2009 J jnl
Projective, affine, and abelian colorings of cubic graphs.
Eur. J. Comb.
Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera
2006 J jnl
Perfect Matching Preservers.
Electron. J. Comb.
Richard A. Brualdi, Martin Loebl, Ondrej Pangrác
2005 J jnl
A note on group colorings.
J. Graph Theory
Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss
2005 B conf
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.
MFCS
Daniel Král, Ondrej Pangrác
2005 J jnl
Locally consistent constraint satisfaction problems.
Theor. Comput. Sci.
Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2004 — conf
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.
SWAT
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
2004 A* conf
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract).
ICALP
Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2004 J jnl
Locally consistent constraint satisfaction problems
Electron. Colloquium Comput. Complex.
Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2004 J jnl
Triangles in random graphs.
Discret. Math.
Martin Loebl, Jirí Matousek, Ondrej Pangrác
2002 B conf
Complexity of Pattern Coloring of Cycle Systems.
WG
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
2001 A conf
On Intersection Graphs of Segments with Prescribed Slopes.
GD
Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác
1999 A conf
Visibility Representations of Complete Graphs.
GD
Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák