Cover Image

Oriented diameter of graphs with diameter $4$ and given edge girth

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lin, Jifu, You, Lihua
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C12, 05C20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An improved upper bound on the oriented diameter of graphs with diameter $4$
by: Lin, Jifu, et al.
Published: (2026)

On the oriented diameter of graphs with given minimum degree
by: Cochran, Garner, et al.
Published: (2024)

Oriented diameter of the complete tripartite graph (III)
by: Liu, Jing, et al.
Published: (2025)

Oriented diameter of the complete tripartite graph (II)
by: Liu, Jing, et al.
Published: (2025)

Size of bipartite graphs with given diameter and connectivity constraints
by: Mafunda, Sonwabile
Published: (2025)

Table of large graphs with given degree and diameter
by: Comellas, Francesc
Published: (2024)

On directed and undirected diameters of vertex-transitive graphs
by: Skresanov, Saveliy V.
Published: (2023)

Extremal diameters of 3-coloring graphs of trees
by: Asgarli, Shamil, et al.
Published: (2025)

The minimum size and maximum diameter of an edge-pancyclic graph of a given order
by: Li, Chengli, et al.
Published: (2024)

Inversion diameter and 2-edge-colored homomorphisms
by: Arana, Carmen, et al.
Published: (2026)

Mutual-visibility problems on graphs of diameter two
by: Cicerone, Serafino, et al.
Published: (2024)

Notes on the diameter of the complement of the power graph of a finite group
by: Ma, Xuanlong, et al.
Published: (2021)

Flexible $3$-valent graphs of even girth
by: Barbieri, Marco, et al.
Published: (2025)

The existence of a spanning tree with leaf distance at least $d$ and leaf degree at most $k$ via the size or the spectral radius with respect to the minimum degree
by: Lin, Jifu, et al.
Published: (2024)

The connectedness of friends-and-strangers graphs about graph parameters and others
by: Zhao, Xinghui, et al.
Published: (2025)

The degree-diameter problem for plane graphs with pentagonal faces
by: Preez, Brandon Du
Published: (2024)

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)

Oriented Diameter of Mixed Graphs with Given Maximum Undirected Degree
by: An, Ran, et al.
Published: (2025)

Diameter two orientability of mixed graphs
by: Li, Hengzhe, et al.
Published: (2024)

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

Critical Kernel Imperfectness in $4$-quasi-transitive and $4$-anti-transitive digraphs of small diameter
by: Benítez-Bobadilla, Germán, et al.
Published: (2024)

On Frobenius graphs of diameter 3 for finite groups
by: Breuer, Thomas, et al.
Published: (2024)

Remoteness of graphs with given size and connectivity constraints
by: Dankelmann, Peter, et al.
Published: (2024)

On Oriented Diameter of Power Graphs
by: Benson, Deepu, et al.
Published: (2024)

Size conditions for admissible or consecutive even cycles in graphs
by: Lin, Jifu
Published: (2026)

Leaf to leaf path lengths in trees of given degree sequence
by: Rautenbach, Dieter, et al.
Published: (2025)

An improved bound for 2-distance coloring of planar graphs with girth six
by: Deniz, Zakir
Published: (2022)

Visibility in graphs under edge and vertex removal
by: Dokyeesun, Pakanun, et al.
Published: (2025)

A Size Condition for Small Diameter Orientable Graphs
by: Boriboon, Sopon, et al.
Published: (2025)

Maximum values of the edge Mostar index in tricyclic graphs
by: Hayat, Fazal, et al.
Published: (2023)

On determinants of tournaments and $\mathcal{D}_k$
by: Zeng, Jing, et al.
Published: (2024)

The diameter of KPKVB random graphs
by: Müller, Tobias, et al.
Published: (2017)

On regular graphs with Šoltés vertices
by: Bašić, Nino, et al.
Published: (2023)

There are no excess one digraphs
by: Filipovski, Slobodan, et al.
Published: (2025)

Branching Ratios of Input Trees for Directed Multigraphs
by: Boldi, Paolo, et al.
Published: (2025)

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

Characterizing all $K_4$-free well-edge-dominated graphs of girth 3
by: Anderson, Sarah E., et al.
Published: (2025)

A note on girth-diameter cages
by: Araujo-Pardo, Gabriela, et al.
Published: (2024)

Oriented Trees in Digraphs without Oriented $4$-cycles
by: Stein, Maya, et al.
Published: (2024)