Cover Image

Sufficient conditions for closed-trailable in digraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dong, Changchang, Yang, Hong, Meng, Jixiang, Liu, Juan
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A new condition on dominated pair degree sum for a digraph to be supereulerian
by: Dong, Changchang, et al.
Published: (2024)

Antidirected hamiltonian paths in $k$-hypertournaments
by: Yang, Hong, et al.
Published: (2024)

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs
by: Dong, Changchang, et al.
Published: (2024)

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

Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4
by: Darbinyan, Samvel Kh.
Published: (2025)

Perfect codes in quartic Cayley graphs of generalized dihedral groups
by: Dong, Chengcheng, et al.
Published: (2025)

Degree conditions for disjoint path covers in digraphs
by: Ma, Ansong, et al.
Published: (2024)

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
by: Liu, Xiangge, et al.
Published: (2025)

Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
by: Liu, Chun-Hung, et al.
Published: (2024)

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

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

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

A new sufficient condition for a 2-strong digraph to be Hamiltonian
by: Darbinyan, Samvel Kh.
Published: (2023)

Sufficient conditions for spanning $k$-trees in tough graphs
by: Jia, Caili, et al.
Published: (2026)

Sufficient conditions for perfect mixed tilings
by: Hurley, Eoin, et al.
Published: (2022)

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

Convergence of spectra of digraph limits
by: Grebík, Jan, et al.
Published: (2025)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
by: Garamvölgyi, Dániel, et al.
Published: (2025)

On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph
by: Wu, Tingzeng, et al.
Published: (2025)

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

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

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

The inversion number of dijoins and blow-up digraphs
by: Wang, Haozhe, et al.
Published: (2024)

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

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

Sufficient conditions for Hamiltonianity in terms of the Zeroth-order General Randić Index
by: Wang, Shuai, 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)

Essential connectivity and spectral radius of graphs
by: Ding, Wenxiu, et al.
Published: (2024)

New 2-closed groups that are not automorphism groups of digraphs
by: Bamberg, John, et al.
Published: (2023)

Sufficient conditions for matching extendability in terms of the Zeroth-order General Randić Index
by: Wang, Shuai, et al.
Published: (2023)

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

Oriented trees and paths in digraphs
by: Stein, Maya
Published: (2023)

A note on digraph splitting
by: Christoph, Micha, et al.
Published: (2023)

Spanning subdivisions in dense digraphs
by: Lee, Hyunwoo
Published: (2023)

Higher diameters of Cayley digraphs
by: Magda, G. C., et al.
Published: (2025)

Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree
by: Li, Peishan
Published: (2025)

Feedback vertex sets of digraphs with bounded maximum degree
by: Ai, Jiangdong, et al.
Published: (2025)

Perfect codes in 2-valent Cayley digraphs on abelian groups
by: Yu, Shilong, et al.
Published: (2023)

Every nonsymmetric $4$-class association scheme can be generated by a digraph
by: Yang, Yuefeng
Published: (2024)

On a family of divisible design digraphs
by: Muzychuk, Mikhail, et al.
Published: (2024)