Image de couverture de livre

Long-eared digraphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Benítez-Bobadilla, Germán, Galeana-Sánchez, Hortensia, Hernández-Cruz, César
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics 05C20, 05C69
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Critical Kernel Imperfectness in $4$-quasi-transitive and $4$-anti-transitive digraphs of small diameter
par: Benítez-Bobadilla, Germán, et autres
Publié: (2024)

The general position number of digraphs
par: V., Ullas Chandran S., et autres
Publié: (2026)

Kernels in digraphs with colored vertices
par: Guevara, Mucuy-kak, et autres
Publié: (2025)

Greedily Constructing Small Quasi-Kernels
par: Clow, Alexander
Publié: (2026)

Characterization of graphs with orientable total domination number equal to $|V|-1$
par: Blázsik, Zoltán L., et autres
Publié: (2024)

On the list version of a conjecture of Erdős and Neumann-Lara
par: Harutyunyan, Ararat, et autres
Publié: (2026)

Star decompositions via orientations
par: Harangi, Viktor
Publié: (2025)

On the maximum intersecting sets of the general semilinear group of degree $2$
par: Maleki, Roghayeh, et autres
Publié: (2024)

Vertex-partitions of 2-edge-colored graphs
par: Bang-Jensen, Jørgen, et autres
Publié: (2025)

On the Small Quasi-kernel conjecture
par: Erdős, Péter L., et autres
Publié: (2023)

Induced subgraph density. IV. New graphs with the Erdős-Hajnal property
par: Nguyen, Tung, et autres
Publié: (2023)

Domination on Vertex-weighted Graphs Induce by a Coloring
par: Garrido-Vizuete, María A., et autres
Publié: (2025)

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of $P_4$
par: Cook, Linda, et autres
Publié: (2022)

Antidirected trees in dense digraphs
par: Stein, Maya, et autres
Publié: (2024)

Linear recurrences for non-log-concave independence polynomials of trees
par: Bautista-Ramos, César, et autres
Publié: (2026)

The intersection densities of transitive actions of $\operatorname{PSL}_{2}(q)$ with cyclic point stabilizers
par: Behajaina, Angelot, et autres
Publié: (2025)

The intersection density of cubic arc-transitive graphs with $2$-arc-regular full automorphism group equal to $\operatorname{PGL}_2(q)$
par: Meagher, Karen, et autres
Publié: (2025)

Nut digraphs
par: Bašić, Nino, et autres
Publié: (2025)

Independent domination bondage number in graphs
par: Mehraban, M., et autres
Publié: (2025)

Stability of $2$-domination number of a graph
par: Mehraban, Mazharuddin, et autres
Publié: (2025)

Unique paired vs edge-vertex minimum dominating sets in trees
par: Miotk, Mateusz, et autres
Publié: (2025)

Stability of the Strong Domination Number of Graphs
par: Alikhani, Saeid, et autres
Publié: (2026)

Improved lower bounds for the maximum order of an induced acyclic subgraph
par: Asgarli, Shamil, et autres
Publié: (2025)

There are no excess one digraphs
par: Filipovski, Slobodan, et autres
Publié: (2025)

Long cycles in vertex transitive digraphs
par: Bucić, Matija, et autres
Publié: (2026)

An equality for balanced digraphs
par: Grinberg, Darij, et autres
Publié: (2025)

An end degree for digraphs
par: Hamann, Matthias, et autres
Publié: (2024)

Normal trees of digraphs
par: Reich, Florian
Publié: (2024)

The minimal nonplanar strong digraphs
par: Bartell, Stephen, et autres
Publié: (2025)

Menger's theorem for ends of digraphs
par: Reich, Florian
Publié: (2026)

On ubiquity problems in infinite digraphs
par: Hamann, Matthias, et autres
Publié: (2026)

Halin's grid theorem for digraphs
par: Reich, Florian
Publié: (2024)

The dib-chromatic number of digraphs
par: Javier-Nol, Nahid, et autres
Publié: (2024)

Cut covers of acyclic digraphs
par: Krone, Maximilian
Publié: (2024)

On the dib-chromatic number of a digraph
par: Montellano-Ballesteros, Juan José, et autres
Publié: (2025)

Transversal Hamilton cycles in digraph collections
par: Cheng, Yangyang, et autres
Publié: (2025)

Generating strongly 2-connected digraphs
par: Hatzel, Meike, et autres
Publié: (2024)

A digraph version of the Friendship Theorem
par: Choi, Myungho, et autres
Publié: (2023)

Competition graphs of degree bounded digraphs
par: Chu, Hojin, et autres
Publié: (2023)

Identifying codes in graphs of given maximum degree: Characterizing trees
par: Chakraborty, Dipayan, et autres
Publié: (2024)