The following pages link to Robert Šámal (Q190571):
Displaying 50 items.
- Graph cores via universal completability (Q322258) (← links)
- Drawing a disconnected graph on the torus (extended abstract) (Q324371) (← links)
- A new proof of Seymour's 6-flow theorem (Q345081) (← links)
- The guarding game is E-complete (Q389949) (← links)
- Tension continuous maps -- their structure and applications (Q427807) (← links)
- (Q591755) (redirect page) (← links)
- An Eberhard-like theorem for pentagons and heptagons (Q603874) (← links)
- Unexpected behaviour of crossing sequences (Q651034) (← links)
- 3-flows with large support (Q777476) (← links)
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes (Q1003838) (← links)
- Antisymmetric flows and strong oriented coloring of planar graphs (Q1417578) (← links)
- Linear bound for majority colourings of digraphs (Q1671650) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- Highly arc-transitive digraphs -- structure and counterexamples (Q1677569) (← links)
- Pancyclicity of strong products of graphs (Q1889847) (← links)
- Vector coloring the categorical product of graphs (Q2191770) (← links)
- Universal completability, least eigenvalue frameworks, and vector colorings (Q2408207) (← links)
- A note on counting flows in signed graphs (Q2420566) (← links)
- Quantum and non-signalling graph isomorphisms (Q2421559) (← links)
- Graph homomorphisms via vector colorings (Q2422244) (← links)
- On tension-continuous mappings (Q2427549) (← links)
- Flow-continuous mappings -- the influence of the group (Q2441642) (← links)
- An example of openly minimal dendrite (Q2703098) (← links)
- Chain of dendrites openly unbounded from below (Q2717050) (← links)
- Irreducible mapping and the lightness of open mappings (Q2782156) (← links)
- New approach to Petersen coloring (Q2857439) (← links)
- (Q2947401) (← links)
- High-girth cubic graphs are homomorphic to the Clebsch graph (Q3083411) (← links)
- Short Cycle Covers of Graphs with Minimum Degree Three (Q3084229) (← links)
- Complexity of the Cop and Robber Guarding Game (Q3111664) (← links)
- (Q3424900) (← links)
- (Q3435479) (← links)
- Fractional covering by cuts (Q3439381) (← links)
- Cubical coloring -- fractional covering by cuts and semidefinite programming (Q3455041) (← links)
- Hamilton cycles in strong products of graphs (Q4676590) (← links)
- (Q4704784) (← links)
- Star Chromatic Index (Q4916092) (← links)
- (Q4940007) (← links)
- Random 2-cell embeddings of multistars (Q5086920) (← links)
- Group connectivity: Z4 vs Z22 (Q5110659) (← links)
- (Q5111407) (← links)
- A rainbow version of Mantel's Theorem (Q5126753) (← links)
- Cycle‐Continuous Mappings—Order Structure (Q5272633) (← links)
- Unexpected behaviour of crossing sequences (Q5301020) (← links)
- A quadratic lower bound for subset sums (Q5310183) (← links)
- On the number of intersections of two polygons. (Q5488104) (← links)
- Induced trees in triangle-free graphs (Q5900077) (← links)
- Induced trees in triangle-free graphs (Q5901518) (← links)
- Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows (Q5915811) (← links)
- Homomorphisms of Cayley graphs and cycle double covers (Q5915822) (← links)
