Robert Šámal

From MaRDI portal
Person:190571

Available identifiers

zbMath Open samal.robertDBLP32/4283WikidataQ95146917 ScholiaQ95146917MaRDI QIDQ190571

List of research outcomes





PublicationDate of PublicationType
Counting circuit double covers2025-01-06Paper
Random embeddings of graphs: the expected number of faces in most graphs is logarithmic2024-11-28Paper
Improved bounds for the binary paint shop problem2024-08-22Paper
Decomposing a triangle-free planar graph into a forest and a subcubic forest2024-02-05Paper
Precoloring extension in planar near-Eulerian-triangulations2023-12-20Paper
Nowhere-zero 8-flows in cyclically 5-edge-connected, flow-admissible signed graphs2023-09-01Paper
Counting Circuit Double Covers2023-03-19Paper
Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters2023-02-23Paper
Random 2-cell embeddings of multistars2022-07-08Paper
Universality in minor-closed graph classes2021-09-01Paper
A rainbow version of Mantel's Theorem2020-10-20Paper
3-flows with large support2020-07-07Paper
Vector coloring the categorical product of graphs2020-06-26Paper
Homomorphisms of Cayley graphs and cycle double covers2020-06-15Paper
https://portal.mardi4nfdi.de/entity/Q51114072020-05-27Paper
Group connectivity: Z4 vs Z222020-05-21Paper
Many flows in the group connectivity setting2020-05-19Paper
Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows2020-02-26Paper
Graph homomorphisms via vector colorings2019-06-18Paper
Quantum and non-signalling graph isomorphisms2019-06-17Paper
A note on counting flows in signed graphs2019-06-06Paper
Linear bound for majority colourings of digraphs2018-09-07Paper
Homomorphisms of Cayley graphs and cycle double covers2018-01-18Paper
Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows2018-01-18Paper
Highly arc-transitive digraphs -- structure and counterexamples2017-11-10Paper
Sabidussi versus Hedetniemi for three variations of the chromatic number2017-11-10Paper
Universal completability, least eigenvalue frameworks, and vector colorings2017-10-10Paper
Cycle‐Continuous Mappings—Order Structure2017-06-30Paper
A new proof of Seymour's 6-flow theorem2016-11-25Paper
Graph cores via universal completability2016-10-14Paper
Drawing a disconnected graph on the torus (extended abstract)2016-10-14Paper
Cubical coloring -- fractional covering by cuts and semidefinite programming2015-12-03Paper
https://portal.mardi4nfdi.de/entity/Q29474012015-09-23Paper
Cycle‐Continuous Mappings—Order Structure2014-06-11Paper
Flow-continuous mappings -- the influence of the group2014-03-25Paper
The guarding game is E-complete2014-01-22Paper
New approach to Petersen coloring2013-11-01Paper
Unexpected behaviour of crossing sequences2013-06-28Paper
Star Chromatic Index2013-04-19Paper
Flow-continuous mappings -- influence of the group2012-12-30Paper
Tension continuous maps -- their structure and applications2012-06-18Paper
Complexity of the Cop and Robber Guarding Game2012-01-13Paper
Unexpected behaviour of crossing sequences2011-12-08Paper
Highly arc-transitive digraphs -- counterexamples and structure2011-10-13Paper
High-girth cubic graphs are homomorphic to the Clebsch graph2011-03-21Paper
Short Cycle Covers of Graphs with Minimum Degree Three2011-03-15Paper
An Eberhard-like theorem for pentagons and heptagons2010-11-08Paper
Induced trees in triangle-free graphs2009-04-07Paper
Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes2009-03-04Paper
Induced trees in triangle-free graphs2008-06-05Paper
On tension-continuous mappings2008-05-13Paper
A quadratic lower bound for subset sums2007-09-20Paper
Fractional covering by cuts2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34354792007-04-26Paper
https://portal.mardi4nfdi.de/entity/Q34249002007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54881042006-09-13Paper
Hamilton cycles in strong products of graphs2005-05-04Paper
Pancyclicity of strong products of graphs2004-12-13Paper
Antisymmetric flows and strong oriented coloring of planar graphs2004-01-05Paper
Irreducible mapping and the lightness of open mappings2002-04-25Paper
The limit checker number of a graph2001-07-18Paper
An example of openly minimal dendrite2001-07-08Paper
Chain of dendrites openly unbounded from below2001-06-13Paper
https://portal.mardi4nfdi.de/entity/Q49400072000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q47047841999-12-19Paper
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is LogarithmicN/APaper
Structure of betweenness uniform graphs with low values of betweenness centralityN/APaper

Research outcomes over time

This page was built for person: Robert Šámal