:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Wang, Haozhe, Yang, Yuxuan, Lu, Mei
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2404.14937
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Inversion diameter and treewidth
by: Wang, Yichen, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

Acyclic subgraphs of digraphs with high chromatic number
by: Yuster, Raphael
Published: (2025)

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

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

Enumeration of dicirculant digraphs
by: Wang, Jing, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

Distant digraph domination
by: Nguyen, Tung, et al.
Published: (2024)

Distance ideals of digraphs
by: Alfaro, Carlos A., et al.
Published: (2024)

Minors of plane digraphs
by: Chudnovsky, Maria, et al.
Published: (2026)

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

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

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

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

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

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

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

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

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

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

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