Cover Image

There is no prime functional digraph: Seifert's proof revisited

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	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

Dividing sums of cycles in the semiring of functional digraphs
by: Bridoux, Florian, et al.
Published: (2025)

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)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, 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)

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

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)

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

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

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)

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)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

A new proof of Delahan's induced-universality result
by: Chappelon, Jonathan
Published: (2026)

Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
by: Ortlieb, Christian, et al.
Published: (2024)

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

Local obstructions in sequences revisited
by: Rosenfeld, Matthieu, et al.
Published: (2025)

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

Feedback vertex sets of planar digraphs with fixed digirth
by: Dreyer, Simon, et al.
Published: (2026)

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

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)

The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
by: Ihringer, Ferdinand
Published: (2023)

Sufficient conditions for perfect mixed tilings
by: Hurley, Eoin, et al.
Published: (2022)

The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)

Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy
by: Gnewuch, Michael
Published: (2024)

Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture
by: Bessy, Stéphane, et al.
Published: (2024)

List homomorphisms to separable signed graphs
by: Bok, Jan, et al.
Published: (2023)

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

A characterization of interval nest digraphs
by: Alcantar, Ayelén, et al.
Published: (2026)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)