Robert Sámal

Eur. J. Comb., February, 2024

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Counting Circuit Double Covers.

[BibT_eX]

[DOI]

CoRR, 2023

Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Improved Bounds for the Binary Paint Shop Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2021

Random 2-cell embeddings of multistars.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Vector coloring the categorical product of graphs.

[BibT_eX]

[DOI]

Math. Program., 2020

Group connectivity: Z4 vs Z22.

[BibT_eX]

[DOI]

Lucie Mohelníková

J. Graph Theory, 2020

3-Flows with large support.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

2019

Quantum and non-signalling graph isomorphisms.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2019

Graph homomorphisms via vector colorings.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

A Note on Counting Flows in Signed Graphs.

[BibT_eX]

[DOI]

Edita Rollová

Electron. J. Comb., 2019

Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows.

[BibT_eX]

[DOI]

Zdenek Dvorák

Comb., 2019

2018

Linear Bound for Majority Colourings of Digraphs.

[BibT_eX]

[DOI]

Fiachra Knox

Electron. J. Comb., 2018

2017

Cycle-Continuous Mappings - Order Structure.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

A new proof of Seymour's 6-flow theorem.

[BibT_eX]

[DOI]

Edita Rollová

J. Comb. Theory, Ser. B, 2017

Homomorphisms of Cayley graphs and Cycle Double Covers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows.

[BibT_eX]

[DOI]

Zdenek Dvorák

Electron. Notes Discret. Math., 2017

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Group Connectivity: Z4 v. Z22.

[BibT_eX]

[DOI]

Lucie Mohelníková

CoRR, 2017

Relaxations of Graph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Sabidussi versus Hedetniemi for three variations of the chromatic number.

[BibT_eX]

[DOI]

Comb., 2016

2015

Graph Cores via Universal Completability.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Drawing a disconnected graph on the torus (Extended abstract).

[BibT_eX]

[DOI]

Sergio Cabello

Electron. Notes Discret. Math., 2015

Cubical coloring - fractional covering by cuts and semidefinite programming.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

Highly arc-transitive digraphs - Structure and counterexamples.

[BibT_eX]

[DOI]

Comb., 2015

2014

The guarding game is E-complete.

[BibT_eX]

[DOI]

Tomás Valla

Theor. Comput. Sci., 2014

Flow-continuous mappings - The influence of the group.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Eur. J. Comb., 2014

2013

Star Chromatic Index.

[BibT_eX]

[DOI]

Zdenek Dvorák

J. Graph Theory, 2013

2012

Tension continuous maps - Their structure and applications.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Eur. J. Comb., 2012

2011

High-girth cubic graphs are homomorphic to the Clebsch graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

New approach to Petersen coloring.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

On the complexity of the guarding game

[BibT_eX]

[DOI]

Tomás Valla

CoRR, 2011

Complexity of the Cop and Robber Guarding Game.

[BibT_eX]

[DOI]

Rudolf Stolar

Tomás Valla

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

Short Cycle Covers of Graphs with Minimum Degree Three.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

An Eberhard-Like Theorem for Pentagons and Heptagons.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

Discret. Comput. Geom., 2010

2009

Cayley sum graphs and eigenvalues of (3, 6)-fullerenes.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2009

2008

Unexpected behaviour of crossing sequences.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

On tension-continuous mappings.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Eur. J. Comb., 2008

2007

Induced trees in triangle-free graphs.

[BibT_eX]

[DOI]

Jirí Matousek

Electron. Notes Discret. Math., 2007

2005

Hamilton cycles in strong products of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Fractional covering by cuts.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

Pancyclicity of Strong Products of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

2003

Antisymmetric flows and strong oriented coloring of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

2001

The limit checker number of a graph.

[BibT_eX]

[DOI]