default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Sámal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Carl Feghali
, Robert Sámal:
Decomposing a triangle-free planar graph into a forest and a subcubic forest. Eur. J. Comb. 116: 103878 (2024)- [c6]Babak Ghanbari, Robert Sámal:
Approximate Cycle Double Cover. IWOCA 2024: 421-432 - [c5]Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal:
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. SODA 2024: 1177-1193 - 2023
- [c4]Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr:
Improved Bounds for the Binary Paint Shop Problem. COCOON (2) 2023: 210-221 - [c3]Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. WG 2023: 305-318 - [i7]Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. CoRR abs/2302.11862 (2023) - [i6]Radek Husek, Robert Sámal:
Counting Circuit Double Covers. CoRR abs/2303.10615 (2023) - 2022
- [i5]Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal:
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. CoRR abs/2211.01032 (2022) - 2021
- [i4]Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal:
Random 2-cell embeddings of multistars. CoRR abs/2103.05036 (2021) - 2020
- [j38]Radek Husek, Robert Sámal:
Homomorphisms of Cayley graphs and Cycle Double Covers. Electron. J. Comb. 27(2): 2 (2020) - [j37]Matt DeVos, Jessica McDonald, Irene Pivotto, Edita Rollová, Robert Sámal:
3-Flows with large support. J. Comb. Theory B 144: 32-80 (2020) - [j36]Radek Husek, Lucie Mohelníková, Robert Sámal:
Group connectivity: Z4 vs Z22. J. Graph Theory 93(3): 317-327 (2020) - [j35]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Vector coloring the categorical product of graphs. Math. Program. 182(1): 275-314 (2020)
2010 – 2019
- 2019
- [j34]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. Comb. 39(6): 1237-1253 (2019) - [j33]Matt DeVos, Edita Rollová, Robert Sámal:
A Note on Counting Flows in Signed Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j32]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Graph homomorphisms via vector colorings. Eur. J. Comb. 79: 244-261 (2019) - [j31]Albert Atserias, Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis:
Quantum and non-signalling graph isomorphisms. J. Comb. Theory B 136: 289-328 (2019) - [i3]Radek Husek, Robert Sámal:
Homomorphisms of Cayley graphs and Cycle Double Covers. CoRR abs/1901.03112 (2019) - 2018
- [j30]Fiachra Knox, Robert Sámal:
Linear Bound for Majority Colourings of Digraphs. Electron. J. Comb. 25(3): 3 (2018) - 2017
- [j29]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. Discret. Comput. Geom. 58(2): 265-292 (2017) - [j28]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows. Electron. Notes Discret. Math. 61: 375-381 (2017) - [j27]Radek Husek, Robert Sámal:
Homomorphisms of Cayley graphs and Cycle Double Covers. Electron. Notes Discret. Math. 61: 639-645 (2017) - [j26]Matt DeVos, Edita Rollová, Robert Sámal:
A new proof of Seymour's 6-flow theorem. J. Comb. Theory B 122: 187-195 (2017) - [j25]Robert Sámal:
Cycle-Continuous Mappings - Order Structure. J. Graph Theory 85(1): 56-73 (2017) - [c2]Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis:
Relaxations of Graph Isomorphism. ICALP 2017: 76:1-76:14 - [i2]Radek Husek, Lucie Mohelníková, Robert Sámal:
Group Connectivity: Z4 v. Z22. CoRR abs/1711.03895 (2017) - 2016
- [j24]Chris D. Godsil, David E. Roberson, Robert Sámal, Simone Severini:
Sabidussi versus Hedetniemi for three variations of the chromatic number. Comb. 36(4): 395-415 (2016) - 2015
- [j23]Matt DeVos, Bojan Mohar, Robert Sámal:
Highly arc-transitive digraphs - Structure and counterexamples. Comb. 35(5): 553-571 (2015) - [j22]Robert Sámal:
Cubical coloring - fractional covering by cuts and semidefinite programming. Discret. Math. Theor. Comput. Sci. 17(2): 251-266 (2015) - [j21]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Graph Cores via Universal Completability. Electron. Notes Discret. Math. 49: 337-344 (2015) - [j20]Sergio Cabello, Bojan Mohar, Robert Sámal:
Drawing a disconnected graph on the torus (Extended abstract). Electron. Notes Discret. Math. 49: 779-786 (2015) - 2014
- [j19]Jaroslav Nesetril, Robert Sámal:
Flow-continuous mappings - The influence of the group. Eur. J. Comb. 36: 342-347 (2014) - [j18]Robert Sámal, Tomás Valla:
The guarding game is E-complete. Theor. Comput. Sci. 521: 92-106 (2014) - 2013
- [j17]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Star Chromatic Index. J. Graph Theory 72(3): 313-326 (2013) - 2012
- [j16]Jaroslav Nesetril, Robert Sámal:
Tension continuous maps - Their structure and applications. Eur. J. Comb. 33(6): 1207-1225 (2012) - 2011
- [j15]Robert Sámal:
New approach to Petersen coloring. Electron. Notes Discret. Math. 38: 755-760 (2011) - [j14]Matt DeVos, Bojan Mohar, Robert Sámal:
Unexpected behaviour of crossing sequences. J. Comb. Theory B 101(6): 448-463 (2011) - [j13]Matt DeVos, Robert Sámal:
High-girth cubic graphs are homomorphic to the Clebsch graph. J. Graph Theory 66(3): 241-259 (2011) - [c1]Robert Sámal, Rudolf Stolar, Tomás Valla:
Complexity of the Cop and Robber Guarding Game. IWOCA 2011: 361-373 - [i1]Robert Sámal, Tomás Valla:
On the complexity of the guarding game. CoRR abs/1112.6140 (2011) - 2010
- [j12]Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Sámal:
An Eberhard-Like Theorem for Pentagons and Heptagons. Discret. Comput. Geom. 44(4): 931-945 (2010) - [j11]Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal:
Short Cycle Covers of Graphs with Minimum Degree Three. SIAM J. Discret. Math. 24(1): 330-355 (2010)
2000 – 2009
- 2009
- [j10]Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal:
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. J. Comb. Theory B 99(2): 358-369 (2009) - 2008
- [j9]Jirí Matousek, Robert Sámal:
Induced Trees in Triangle-Free Graphs. Electron. J. Comb. 15(1) (2008) - [j8]Jaroslav Nesetril, Robert Sámal:
On tension-continuous mappings. Eur. J. Comb. 29(4): 1025-1054 (2008) - [j7]Matt DeVos, Bojan Mohar, Robert Sámal:
Unexpected behaviour of crossing sequences. Electron. Notes Discret. Math. 31: 259-264 (2008) - 2007
- [j6]Jirí Matousek, Robert Sámal:
Induced trees in triangle-free graphs. Electron. Notes Discret. Math. 29: 307-313 (2007) - 2005
- [j5]Robert Sámal:
Fractional covering by cuts. Electron. Notes Discret. Math. 22: 455-459 (2005) - [j4]Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský:
Hamilton cycles in strong products of graphs. J. Graph Theory 48(4): 299-321 (2005) - 2004
- [j3]Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal:
Pancyclicity of Strong Products of Graphs. Graphs Comb. 20(1): 91-104 (2004) - 2003
- [j2]Robert Sámal:
Antisymmetric flows and strong oriented coloring of planar graphs. Discret. Math. 273(1-3): 203-209 (2003) - 2001
- [j1]Robert Sámal, Jan Vondrák:
The limit checker number of a graph. Discret. Math. 235(1-3): 343-347 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
