Imagen de Portada

Subdivisions in dicritical digraphs with large order or digirth

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Picasarri-Arrieta, Lucas, Rambaud, Clément
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the minimum number of arcs in $4$-dicritical oriented graphs
por: Havet, Frédéric, et al.
Publicado: (2023)

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

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

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

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

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

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

Increasing arc-connectivity by bounded- and fixed-size inversions
por: Hörsch, Florian, et al.
Publicado: (2026)

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

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

Excluding a rectangular grid
por: Rambaud, Clément
Publicado: (2025)

Dichromatic number of chordal graphs
por: Bessy, Stéphane, et al.
Publicado: (2023)

Backbone colouring of chordal graphs
por: Araújo, Júlio, et al.
Publicado: (2025)

Constrained Flows in Networks
por: Bessy, Stéphane, et al.
Publicado: (2023)

Acyclic dichromatic number of oriented graphs
por: Bang-Jensen, Jørgen, et al.
Publicado: (2025)

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

Chromatic discrepancy of locally $s$-colourable graphs
por: Corsini, Timothée, et al.
Publicado: (2025)

On cuts of small chromatic number in sparse graphs
por: Aubian, Guillaume, et al.
Publicado: (2025)

Diameter of the inversion graph
por: Havet, Frédéric, et al.
Publicado: (2024)

Partitioning a Planar Graph into two Triangle-Forests
por: Knauer, Kolja, et al.
Publicado: (2024)

On the $(\leq p)$-inversion diameter of oriented graphs
por: Havet, Frédéric, et al.
Publicado: (2026)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
por: Claus, Quentin, et al.
Publicado: (2026)

The 3-dicritical semi-complete digraphs
por: Havet, Frédéric, et al.
Publicado: (2024)

Quickly excluding an apex-forest
por: Hodor, Jędrzej, et al.
Publicado: (2024)

Weak coloring numbers of minor-closed graph classes
por: Hodor, Jędrzej, et al.
Publicado: (2024)

Centered colorings in minor-closed graph classes
por: Hodor, Jędrzej, et al.
Publicado: (2024)

Centered colorings and weak coloring numbers in minor-closed graph classes
por: Hodor, Jędrzej, et al.
Publicado: (2026)

Sample compression schemes for balls in structurally sparse graphs
por: Bourneuf, Romain, et al.
Publicado: (2026)

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

Cops and robber in graphs with bounded vertex cover number
por: Bose, Prosenjit, et al.
Publicado: (2026)

Invertibility of digraphs and tournaments
por: Alon, Noga, et al.
Publicado: (2022)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
por: Lozin, Vadim, et al.
Publicado: (2022)

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

Karp's patching algorithm on dense digraph
por: Frieze, Alan
Publicado: (2025)

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

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

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

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

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

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