:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kiefer, Stefan, Ryzhikov, Andrew
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Combinatorics
Online Access:	https://arxiv.org/abs/2408.05762
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

On shortest products for nonnegative matrix mortality
by: Ryzhikov, Andrew
Published: (2024)

Careful synchronisation and the diameter of transformation semigroups with few generators
by: Ryzhikov, Andrew
Published: (2025)

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

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

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

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)

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

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

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

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

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)

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)

Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, 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)

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

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
by: Kiefer, Sandra, et al.
Published: (2024)

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

Graceful coloring is computationally hard
by: Antony, Cyriac, et al.
Published: (2024)

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

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

Solving systems of equations on antichains for the computation of the ninth Dedekind Number
by: De Causmaecker, Patrick, et al.
Published: (2024)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Boundary rigidity of finite CAT(0) cube complexes
by: Chalopin, Jérémie, et al.
Published: (2023)

On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
by: Garzón, E. M., et al.
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)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)

Parameterized complexity of $r$-Hop, $r$-Step, and $r$-Hop Roman Domination
by: Das, Sandip, et al.
Published: (2026)