Robert Sámal

According to our database1, Robert Sámal authored at least 33 papers between 2001 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Quantum and non-signalling graph isomorphisms.
J. Comb. Theory, Ser. B, 2019

2018
Linear Bound for Majority Colourings of Digraphs.
Electr. J. Comb., 2018

2017
Cycle-Continuous Mappings - Order Structure.
Journal of Graph Theory, 2017

A new proof of Seymour's 6-flow theorem.
J. Comb. Theory, Ser. B, 2017

Homomorphisms of Cayley graphs and Cycle Double Covers.
Electronic Notes in Discrete Mathematics, 2017

Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows.
Electronic Notes in Discrete Mathematics, 2017

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings.
Discrete & Computational Geometry, 2017

Relaxations of Graph Isomorphism.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Sabidussi versus Hedetniemi for three variations of the chromatic number.
Combinatorica, 2016

2015
Graph Cores via Universal Completability.
Electronic Notes in Discrete Mathematics, 2015

Drawing a disconnected graph on the torus (Extended abstract).
Electronic Notes in Discrete Mathematics, 2015

Cubical coloring - fractional covering by cuts and semidefinite programming.
Discrete Mathematics & Theoretical Computer Science, 2015

Highly arc-transitive digraphs - Structure and counterexamples.
Combinatorica, 2015

2014
The guarding game is E-complete.
Theor. Comput. Sci., 2014

Flow-continuous mappings - The influence of the group.
Eur. J. Comb., 2014

2013
Star Chromatic Index.
Journal of Graph Theory, 2013

2012
Tension continuous maps - Their structure and applications.
Eur. J. Comb., 2012

2011
High-girth cubic graphs are homomorphic to the Clebsch graph.
Journal of Graph Theory, 2011

Unexpected behaviour of crossing sequences.
J. Comb. Theory, Ser. B, 2011

New approach to Petersen coloring.
Electronic Notes in Discrete Mathematics, 2011

Complexity of the Cop and Robber Guarding Game.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010
Short Cycle Covers of Graphs with Minimum Degree Three.
SIAM J. Discrete Math., 2010

An Eberhard-Like Theorem for Pentagons and Heptagons.
Discrete & Computational Geometry, 2010

2009
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes.
J. Comb. Theory, Ser. B, 2009

2008
Unexpected behaviour of crossing sequences.
Electronic Notes in Discrete Mathematics, 2008

On tension-continuous mappings.
Eur. J. Comb., 2008

Induced Trees in Triangle-Free Graphs.
Electr. J. Comb., 2008

2007
Induced trees in triangle-free graphs.
Electronic Notes in Discrete Mathematics, 2007

2005
Hamilton cycles in strong products of graphs.
Journal of Graph Theory, 2005

Fractional covering by cuts.
Electronic Notes in Discrete Mathematics, 2005

2004
Pancyclicity of Strong Products of Graphs.
Graphs and Combinatorics, 2004

2003
Antisymmetric flows and strong oriented coloring of planar graphs.
Discrete Mathematics, 2003

2001
The limit checker number of a graph.
Discrete Mathematics, 2001


  Loading...