Ondřej Pangrác
Ondřej Pangrác
Computer Science Institute, Charles University, Prague
Verified email at iuuk.mff.cuni.cz - Homepage
Cited by
Cited by
Length-bounded cuts and flows
G Baier, T Erlebach, A Hall, E Köhler, P Kolman, O Pangrác, H Schilling, ...
ACM Transactions on Algorithms (TALG) 7 (1), 1-27, 2010
On the complexity of paths avoiding forbidden pairs
P Kolman, O Pangrác
Discrete Applied Mathematics 157 (13), 2871-2876, 2009
Projective, affine, and abelian colorings of cubic graphs
E Máčajová, O Pangrác, A Raspaud, JS Sereni, M Škoviera
European Journal of Combinatorics 30 (1), 53-69, 2009
A note on group colorings
D Král', O Pangrác, HJ Voss
Journal of Graph Theory 50 (2), 123-129, 2005
An algorithm for cyclic edge connectivity of cubic graphs
Z Dvořák, J Kára, O Pangrác
Scandinavian Workshop on Algorithm Theory, 236-247, 2004
Long cycles in fullerene graphs
O Pangrác, JS Sereni, R Škrekovski
Journal of mathematical chemistry 45 (4), 1021-1031, 2009
5-coloring graphs with 4 crossings
R Erman, F Havet, B Lidický, O Pangrác
SIAM Journal on Discrete Mathematics 25 (1), 401-422, 2011
Markov bases of binary graph models of K4-minor free graphs
S Norine, O Pangrác
Journal of Combinatorial Theory, Series A 117 (6), 759-765, 2010
On intersection graphs of segments with prescribed slopes
J Černý, D Král, H Nyklová, O Pangrác
International Symposium on Graph Drawing, 261-271, 2001
Pattern hypergraphs
Z Dvořák, J Kára, O Pangrác
the electronic journal of combinatorics, R15-R15, 2010
Integral functionals that are continuous with respect to the weak topology on W01, p (0, 1)
S Hencl, J Kolář, O Pangrác
Nonlinear Analysis: Theory, Methods & Applications 63 (1), 81-87, 2005
Triangles in random graphs
M Loebl, J Matoušek, O Pangrác
Discrete mathematics 289 (1-3), 181-185, 2004
Flexibility of planar graphs of girth at least six
Z Dvořák, T Masařík, J Musílek, O Pangrác
Journal of Graph Theory 95 (3), 457-466, 2020
Coloring Eulerian triangulations of the Klein bottle
B Mohar, A Nakamoto, O Pangrác, Y Suzuki
Graphs and Combinatorics 28 (4), 499-530, 2012
Visibility representations of complete graphs
R Babilon, H Nyklová, O Pangrác, J Vondrák
International Symposium on Graph Drawing, 333-340, 1999
Flexibility of triangle‐free planar graphs
Z Dvořák, T Masařík, J Musílek, O Pangrác
Journal of Graph Theory 96 (4), 619-641, 2021
Locally consistent constraint satisfaction problems
Z Dvořák, O Pangrác
International Colloquium on Automata, Languages, and Programming, 469-480, 2004
Complexity of pattern coloring of cycle systems
Z Dvořák, J Kára, O Pangrác
International Workshop on Graph-Theoretic Concepts in Computer Science, 164-175, 2002
Triangle‐free planar graphs with the smallest independence number
Z Dvořák, T Masařík, J Musílek, O Pangrác
Journal of Graph Theory 90 (3), 443-454, 2019
Perfect matching preservers
RA Brualdi, M Loebl, O Pangrác
the electronic journal of combinatorics, R95-R95, 2006
The system can't perform the operation now. Try again later.
Articles 1–20