3 citations · 5 across the 7 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
Cycle-continuous mappings -- order structure
Robert Šámal
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for e…
math.CO2012
Flow-continuous mappings -- influence of the group
Robert Šámal
Many questions at the core of graph theory can be formulated as questions about certain group-valued flows: examples are the cycle double cover conjecture, Berge-Fulkerson conjectu…