The limit checker number of a graph. - Robert Sámal; Jan Vondrák (Discret. Math., 2001)

Antisymmetric flows and strong oriented coloring of planar graphs. - Robert Sámal (Discret. Math., 2003)

Pancyclicity of Strong Products of Graphs. - Daniel Král; Jana Maxová; Pavel Podbrdský; Robert Sámal (Graphs Comb., 2004)

Fractional covering by cuts. - Robert Sámal (Electron. Notes Discret. Math., 2005)

Hamilton cycles in strong products of graphs. - Daniel Král; Jana Maxová; Robert Sámal; Pavel Podbrdský (J. Graph Theory, 2005)

Induced trees in triangle-free graphs. - Jirí Matousek 001; Robert Sámal (Electron. Notes Discret. Math., 2007)

On tension-continuous mappings. - Jaroslav Nesetril; Robert Sámal (Eur. J. Comb., 2008)

Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. - Matt DeVos; Luis A. Goddyn; Bojan Mohar; Robert Sámal (J. Comb. Theory B, 2009)

An Eberhard-Like Theorem for Pentagons and Heptagons. - Matt DeVos; Agelos Georgakopoulos; Bojan Mohar; Robert Sámal (Discret. Comput. Geom., 2010)

Short Cycle Covers of Graphs with Minimum Degree Three. - Tomás Kaiser; Daniel Král'; Bernard Lidický; Pavel Nejedlý; Robert Sámal (SIAM J. Discret. Math., 2010)

Complexity of the Cop and Robber Guarding Game. - Robert Sámal; Rudolf Stolar; Tomás Valla (IWOCA, 2011)

On the complexity of the guarding game - Robert Sámal; Tomás Valla (CoRR, 2011)

New approach to Petersen coloring. - Robert Sámal (Electron. Notes Discret. Math., 2011)

Unexpected behaviour of crossing sequences. - Matt DeVos; Bojan Mohar; Robert Sámal (J. Comb. Theory B, 2011)

High-girth cubic graphs are homomorphic to the Clebsch graph. - Matt DeVos; Robert Sámal (J. Graph Theory, 2011)

Tension continuous maps - Their structure and applications. - Jaroslav Nesetril; Robert Sámal (Eur. J. Comb., 2012)

Star Chromatic Index. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (J. Graph Theory, 2013)

Flow-continuous mappings - The influence of the group. - Jaroslav Nesetril; Robert Sámal (Eur. J. Comb., 2014)

The guarding game is E-complete. - Robert Sámal; Tomás Valla (Theor. Comput. Sci., 2014)

Highly arc-transitive digraphs - Structure and counterexamples. - Matt DeVos; Bojan Mohar; Robert Sámal (Comb., 2015)

Cubical coloring - fractional covering by cuts and semidefinite programming. - Robert Sámal (Discret. Math. Theor. Comput. Sci., 2015)

Drawing a disconnected graph on the torus (Extended abstract). - Sergio Cabello; Bojan Mohar; Robert Sámal (Electron. Notes Discret. Math., 2015)

Graph Cores via Universal Completability. - Chris D. Godsil; David E. Roberson; Brendan Rooney; Robert Sámal; Antonios Varvitsiotis (Electron. Notes Discret. Math., 2015)

Sabidussi versus Hedetniemi for three variations of the chromatic number. - Chris D. Godsil; David E. Roberson; Robert Sámal; Simone Severini (Comb., 2016)

Relaxations of Graph Isomorphism. - Laura Mancinska; David E. Roberson; Robert Sámal; Simone Severini; Antonios Varvitsiotis (ICALP, 2017)

Group Connectivity: Z4 v. Z22. - Radek Husek; Lucie Mohelníková; Robert Sámal (CoRR, 2017)

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. - Chris D. Godsil; David E. Roberson; Brendan Rooney; Robert Sámal; Antonios Varvitsiotis (Discret. Comput. Geom., 2017)

Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (Electron. Notes Discret. Math., 2017)

Homomorphisms of Cayley graphs and Cycle Double Covers. - Radek Husek; Robert Sámal (Electron. Notes Discret. Math., 2017)

A new proof of Seymour's 6-flow theorem. - Matt DeVos; Edita Rollová; Robert Sámal (J. Comb. Theory B, 2017)

Cycle-Continuous Mappings - Order Structure. - Robert Sámal (J. Graph Theory, 2017)

Linear Bound for Majority Colourings of Digraphs. - Fiachra Knox; Robert Sámal (Electron. J. Comb., 2018)

Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (Comb., 2019)

A Note on Counting Flows in Signed Graphs. - Matt DeVos; Edita Rollová; Robert Sámal (Electron. J. Comb., 2019)

Graph homomorphisms via vector colorings. - Chris D. Godsil; David E. Roberson; Brendan Rooney; Robert Sámal; Antonios Varvitsiotis (Eur. J. Comb., 2019)

Quantum and non-signalling graph isomorphisms. - Albert Atserias; Laura Mancinska; David E. Roberson; Robert Sámal; Simone Severini; Antonios Varvitsiotis (J. Comb. Theory B, 2019)

3-Flows with large support. - Matt DeVos; Jessica McDonald; Irene Pivotto; Edita Rollová; Robert Sámal (J. Comb. Theory B, 2020)

Group connectivity: Z4 vs Z22. - Radek Husek; Lucie Mohelníková; Robert Sámal (J. Graph Theory, 2020)

Vector coloring the categorical product of graphs. - Chris D. Godsil; David E. Roberson; Brendan Rooney; Robert Sámal; Antonios Varvitsiotis (Math. Program., 2020)

Random 2-cell embeddings of multistars. - Jesse Campion Loth; Kevin Halasz; Tomás Masarík; Bojan Mohar; Robert Sámal (CoRR, 2021)

Improved Bounds for the Binary Paint Shop Problem. - Jaroslav Hancl; Adam Kabela; Michal Opler; Jakub Sosnovec; Robert Sámal; Pavel Valtr 001 (COCOON (2), 2023)

Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. - Pavel Dvorák; Lukás Folwarczný; Michal Opler; Pavel Pudlák; Robert Sámal; Tung Anh Vu (WG, 2023)

Approximate Cycle Double Cover. - Babak Ghanbari; Robert Sámal (IWOCA, 2024)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. - Jesse Campion Loth; Kevin Halasz; Tomás Masarík; Bojan Mohar; Robert Sámal (SODA, 2024)

Decomposing a triangle-free planar graph into a forest and a subcubic forest. - Carl Feghali; Robert Sámal (Eur. J. Comb., 2024)

Precoloring extension in planar near-Eulerian-triangulations. - Zdenek Dvorák 001; Benjamin R. Moore; Michaela Seifrtová; Robert Sámal (Eur. J. Comb., 2025)

Counting circuit double covers. - Radek Husek; Robert Sámal (J. Graph Theory, 2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs. - Babak Ghanbari; Robert Sámal (CoRR, 2025)