:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Haozhe, Yang, Yuxuan, Lu, Mei
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	https://arxiv.org/abs/2404.14937
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the total Italian domination number in digraphs
por: Dong, Changchang, et al.
Publicado: (2024)

Inversion diameter and treewidth
por: Wang, Yichen, et al.
Publicado: (2024)

A note on inverting the dijoin of oriented graphs
por: Behague, Natalie, et al.
Publicado: (2024)

On the Turán number of blow-ups of $\mathcal{F}_5$
por: Zhao, Xiamiao, et al.
Publicado: (2026)

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

A case of the dijoin conjecture on inverting oriented graphs
por: Behague, Natalie, et al.
Publicado: (2025)

The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
por: Liu, Jianxi
Publicado: (2026)

Oriented Ramsey numbers of graded digraphs
por: Morawski, Patryk, et al.
Publicado: (2024)

Ramsey numbers of digraphs with local edge structure
por: Bradač, Domagoj, et al.
Publicado: (2025)

Enumeration of spanning trees and resistance distances of generalized blow-up graphs
por: Liu, Hechao, et al.
Publicado: (2025)

The dib-chromatic number of digraphs
por: Javier-Nol, Nahid, et al.
Publicado: (2024)

Independent transversal blow-up of graphs
por: Dai, Tianjiao, et al.
Publicado: (2025)

Acyclic subgraphs of digraphs with high chromatic number
por: Yuster, Raphael
Publicado: (2025)

On Hamiltonian bypasses in digraphs and bipartite digraphs
por: Darbinyan, Samvel Kh.
Publicado: (2025)

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

Enumeration of dicirculant digraphs
por: Wang, Jing, et al.
Publicado: (2024)

Weakly distance-regular digraphs of diameter 2
por: Wang, Xiangli, et al.
Publicado: (2025)

On the dib-chromatic number of a digraph
por: Montellano-Ballesteros, Juan José, et al.
Publicado: (2025)

The general position number of digraphs
por: V., Ullas Chandran S., et al.
Publicado: (2026)

Locally semicomplete weakly distance-regular digraphs
por: Yang, Yuefeng, et al.
Publicado: (2024)

Semicomplete multipartite weakly distance-regular digraphs
por: Li, Shuang, et al.
Publicado: (2025)

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

A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
por: McCarthy, Dermot, et al.
Publicado: (2024)

Turán number of complete bipartite graphs with bounded matching number
por: Luo, Huan, et al.
Publicado: (2024)

Sufficient conditions for closed-trailable in digraphs
por: Dong, Changchang, et al.
Publicado: (2024)

Oriented trees in digraphs with large girth
por: Lu, Junying, et al.
Publicado: (2025)

Distant digraph domination
por: Nguyen, Tung, et al.
Publicado: (2024)

Distance ideals of digraphs
por: Alfaro, Carlos A., et al.
Publicado: (2024)

Minors of plane digraphs
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Matrices with simple symmetric digraphs and their group inverses
por: Nandi, Raju
Publicado: (2023)

Zykov sums of digraphs with diachromatic number equal to their harmonious number
por: Olsen, Mika, et al.
Publicado: (2022)

Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
por: Wang, Yichen, et al.
Publicado: (2026)

Some inner metric parameters of a digraph: Iterated line digraphs and integer sequences
por: Bong, N. H., et al.
Publicado: (2024)

Spread blow-up lemma with an application to perturbed random graphs
por: Nenadov, Rajko, et al.
Publicado: (2024)

Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
por: Zeng, Qing, et al.
Publicado: (2024)

Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
por: Yang, Yuefeng, et al.
Publicado: (2023)

Polynomial-delay generation of functional digraphs up to isomorphism
por: Defrain, Oscar, 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)

On the length of directed paths in digraphs
por: Cheng, Yangyang, et al.
Publicado: (2024)

A study on token digraphs
por: Fernandes, Cristina G., et al.
Publicado: (2024)