Robert Šámal

Most-cited papers

Quantum and non-signalling graph isomorphisms
Albert Atserias, L. Mančinska, David E. Roberson, Robert Šámal +2 more
2016J. Comb. Theory B134 citations Open access
Semantic Scholar
A rainbow version of Mantel's Theorem
Robert Šámal, A. Montejano, Sebastián González Hermosillo de la Maza, Matt DeVos +1 more
2018Advances in Combinatorics76 citations Open access
Semantic Scholar
Star Chromatic Index
Z. Dvořák, B. Mohar, Robert Šámal
2010Journal of Graph Theory55 citations
Semantic Scholar
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes
Matt DeVos, L. Goddyn, B. Mohar, Robert Šámal
2007J. Comb. Theory B54 citations
Semantic Scholar
On Six Problems Posed by Jarik Nešetřil
J. Bang-Jensen, Bruce Reed, M. Schacht, Robert Šámal +2 more
200630 citations
Semantic Scholar
Sabidussi versus Hedetniemi for three variations of the chromatic number
C. Godsil, David E. Roberson, Robert Šámal, S. Severini
2013Comb.27 citations
Semantic Scholar
Short Cycle Covers of Graphs with Minimum Degree Three
Tomáš Kaiser, D. Král', B. Lidický, P. Nejedlý +1 more
2009SIAM Journal on Discrete Mathematics24 citations Open access
Semantic Scholar
Linear Bound for Majority Colourings of Digraphs
Fiachra Knox, Robert Šámal
2017Electronic Journal of Combinatorics20 citations Open access
Semantic Scholar
On tension-continuous mappings
J. Nešetřil, Robert Šámal
2008European journal of combinatorics (Print)19 citations Open access
Semantic Scholar
On XY Mappings
Robert Šámal
200617 citations
Semantic Scholar
New approach to Petersen coloring
Robert Šámal
2011Electron. Notes Discret. Math.14 citations
Semantic Scholar
Induced Trees in Triangle-Free Graphs
J. Matoušek, Robert Šámal
2007Electronic Journal of Combinatorics14 citations Open access
Semantic Scholar
A quadratic lower bound for subset sums
Matt DeVos, L. Goddyn, B. Mohar, Robert Šámal
200612 citations Open access
Semantic Scholar
Short Cycle Covers of Cubic Graphs
D. Král', P. Nejedlý, Robert Šámal
12 citations
Semantic Scholar
Graph homomorphisms via vector colorings
C. Godsil, David E. Roberson, Brendan Rooney, Robert Šámal +1 more
2016European journal of combinatorics (Print)11 citations Open access
Semantic Scholar
Random 2-cell embeddings of multistars
Jesse Campion Loth, Kevin Halasz, Tomáš Masařík, B. Mohar +1 more
2021Trends in Mathematics10 citations
Semantic Scholar
A Note on Counting Flows in Signed Graphs
Matt DeVos, Edita Rollová, Robert Šámal
2017Electronic Journal of Combinatorics10 citations Open access
Semantic Scholar
Unexpected behaviour of crossing sequences
Matt DeVos, B. Mohar, Robert Šámal
2008Electron. Notes Discret. Math.10 citations Open access
Semantic Scholar
Fractional covering by cuts
Robert Šámal
2005Electron. Notes Discret. Math.10 citations
Semantic Scholar
Decomposing a triangle-free planar graph into a forest and a subcubic forest
Carl Feghali, Robert Šámal
2020European journal of combinatorics (Print)9 citations Open access
Semantic Scholar
Vector coloring the categorical product of graphs
C. Godsil, David E. Roberson, Brendan Rooney, Robert Šámal +1 more
2018Mathematical programming9 citations Open access
Semantic Scholar
Relaxations of Graph Isomorphism
L. Mančinska, David E. Roberson, Robert Šámal, S. Severini +1 more
2017International Colloquium on Automata, Languages and Programming9 citations
Semantic Scholar
Cycle‐Continuous Mappings—Order Structure
Robert Šámal
2012Journal of Graph Theory9 citations Open access
Semantic Scholar
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings
C. Godsil, David E. Roberson, Brendan Rooney, Robert Šámal +1 more
2015Discrete & Computational Geometry7 citations Open access
Semantic Scholar
Cubical coloring - fractional covering by cuts and semidefinite programming
Robert Šámal
2009Discrete Mathematics & Theoretical Computer Science7 citations Open access
Semantic Scholar
Tension continuous maps - Their structure and applications
J. Nešetřil, Robert Šámal
2005European journal of combinatorics (Print)7 citations Open access
Semantic Scholar
Antisymmetric flows and strong oriented coloring of planar graphs
Robert Šámal
2003Discrete Mathematics7 citations Open access
Semantic Scholar
Complexity of the Cop and Robber Guarding Game
Robert Šámal, R. Stolar, T. Valla
2011International Workshop on Combinatorial Algorithms6 citations
Semantic Scholar
Structure of betweenness uniform graphs with low values of betweenness centrality
Babak Ghanbari, David Hartman, V'it Jel'inek, Aneta Pokorná +2 more
2023Discrete Applied Mathematics5 citations Open access
Semantic Scholar
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows
Zdeněk Dvořák, B. Mohar, Robert Šámal
2017Combinatorica5 citations
Semantic Scholar
A new proof of Seymour's 6-flow theorem
Matt DeVos, Edita Rollová, Robert Šámal
2015J. Comb. Theory B5 citations Open access
Semantic Scholar
Mathematics++: Selected Topics Beyond the Basic Courses
Ida Kantor, J. Matoušek, Robert Šámal
20155 citations
Semantic Scholar
Hamilton cycles in strong products of graphs
D. Král', Jana Maxová, Robert Šámal, Pavel Podbrdský
2005Journal of Graph Theory5 citations Open access
Semantic Scholar
Group connectivity: Z4 vs Z22
Radek Husek, L. Mohelníková, Robert Šámal
2019Journal of Graph Theory4 citations
Semantic Scholar
3-Flows with large support
Matt DeVos, Jessica McDonald, Irene Pivotto, Edita Rollová +1 more
2017J. Comb. Theory B4 citations Open access
Semantic Scholar
Group Connectivity: Z4 v. Z22
Radek Husek, L. Mohelníková, Robert Šámal
2017arXiv.org4 citations
Semantic Scholar
Highly arc-transitive digraphs — Structure and counterexamples
Matt DeVos, B. Mohar, Robert Šámal
2015Comb.4 citations
Semantic Scholar
Cayley sum graphs and eigenvalues of (3,6)-fullerenes
Matt DeVos, L. Goddyn, B. Mohar, Robert Šámal
20094 citations Open access
Semantic Scholar
On the number of intersections of two polygons
Jakub Černý, Jan Kára, D. Král', Pavel Podbrdský +2 more
20034 citations
Semantic Scholar
Improved Bounds for the Binary Paint Shop Problem
Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec +2 more
2023International Computing and Combinatorics Conference3 citations
Semantic Scholar
Graph Cores via Universal Completability
C. Godsil, David E. Roberson, Brendan Rooney, Robert Šámal +1 more
2015Electron. Notes Discret. Math.3 citations
Semantic Scholar
High‐girth cubic graphs are homomorphic to the Clebsch graph
Matt DeVos, Robert Šámal
2006Journal of Graph Theory3 citations Open access
Semantic Scholar
Pancyclicity of Strong Products of Graphs
D. Král', Jana Maxová, Pavel Podbrdský, Robert Šámal
2004Graphs Comb.3 citations
Semantic Scholar
Nowhere-zero 8-flows in cyclically 5-edge-connected, flow-admissible signed graphs
M. Devos, Kathryn Nurse, Robert Šámal
20232 citations
Semantic Scholar
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
Jesse Campion Loth, Kevin Halasz, Tomáš Masařík, B. Mohar +1 more
2022ACM-SIAM Symposium on Discrete Algorithms2 citations Open access
Semantic Scholar
Many flows in the group connectivity setting
Matt DeVos, Rikke Langhede, B. Mohar, Robert Šámal
20202 citations
Semantic Scholar
Drawing a disconnected graph on the torus (Extended abstract)
S. Cabello, B. Mohar, Robert Šámal
2015Electron. Notes Discret. Math.2 citations
Semantic Scholar
Flow-continuous mappings - The influence of the group
J. Nešetřil, Robert Šámal
2012European journal of combinatorics (Print)2 citations Open access
Semantic Scholar
Highly arc-transitive digraphs -- counterexamples and structure
Matt DeVos, B. Mohar, Robert Šámal
20112 citations
Semantic Scholar
The guarding game is E-complete
Robert Šámal, T. Valla
2011Theoretical Computer Science2 citations Open access
Semantic Scholar