Cover Image

Dividing sums of cycles in the semiring of functional digraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bridoux, Florian, Crespelle, Christophe, Phan, Thi Ha Duong, Richard, Adrien
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, et al.
Published: (2024)

Interaction graphs of isomorphic automata networks II: universal dynamics
by: Bridoux, Florian, et al.
Published: (2024)

There is no prime functional digraph: Seifert's proof revisited
by: Richard, Adrien
Published: (2025)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)

On solving basic equations over the semiring of functional digraphs
by: Dennunzio, Alberto, et al.
Published: (2024)

Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

Invertibility of digraphs and tournaments
by: Alon, Noga, et al.
Published: (2022)

Generalized DP-colorings of digraphs
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)

$(Δ-1)$-dicolouring of digraphs
by: Harutyunyan, Ararat, et al.
Published: (2025)

An analogue of Reed's conjecture for digraphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2024)

Karp's patching algorithm on dense digraph
by: Frieze, Alan
Published: (2025)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)

The complexity of computing the period and the exponent of a digraph
by: Kiefer, Stefan, et al.
Published: (2024)

Subdivisions in dicritical digraphs with large order or digirth
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)

Bounding the chromatic number of dense digraphs by arc neighborhoods
by: Klingelhoefer, Felix, et al.
Published: (2023)

Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)

(Claw, C_3)-free digraphs with unbounded dichromatic number
by: Aubian, Guillaume, et al.
Published: (2026)

Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
by: Yu, Shanshan, et al.
Published: (2026)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Planar cycle-extendable graphs
by: Dalwadi, Aditya Y, et al.
Published: (2024)

Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)

Erdős--Pósa property of cycles that are far apart
by: Dujmović, Vida, et al.
Published: (2024)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

On the existence of factors intersecting sets of cycles in regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

Revisiting classical results on kernels in digraphs
by: Langlois, Hélène, et al.
Published: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
by: Dai, Mengyao, et al.
Published: (2025)

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
by: Ai, Jiangdong, et al.
Published: (2025)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Polynomial-delay generation of functional digraphs up to isomorphism
by: Defrain, Oscar, et al.
Published: (2023)

A unified convention for achievement positional games
by: Galliot, Florian, et al.
Published: (2025)

Geodetic Graphs: Experiments and New Constructions
by: Stober, Florian, et al.
Published: (2023)

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
by: Sawada, J., et al.
Published: (2023)

Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)