Cover Image

Bound on shortest cycle covers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Song, Deping, Zhu, Xuding
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

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
by: Xu, Xiaoyan, et al.
Published: (2025)

A survey on Hedetniemi's conjecture
by: Zhu, Xuding
Published: (2025)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Truncated degree AT-orientations of outerplanar graphs
by: Deng, Chenglong, et al.
Published: (2024)

Odd 4-coloring of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2024)

List colouring triangle free planar graphs
by: Hu, Jianzhang, et al.
Published: (2019)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
by: Jin, Ligang, et al.
Published: (2024)

Arc weighted acyclic orientations and variations of degeneracy of graphs
by: Zhou, Huan, et al.
Published: (2023)

Degree-truncated choosability of graphs
by: Zhou, Huan, et al.
Published: (2025)

On graphs coverable by k shortest paths
by: Dumas, Maël, et al.
Published: (2022)

List packing of graphs with bounded tree-width
by: Kashima, Masaki, et al.
Published: (2026)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Degree-truncated choosability of planar graphs
by: Jiang, Yiting, et al.
Published: (2024)

Number of edges with shortest cycle k in a Kautz graph
by: Faber, Vance
Published: (2025)

Indicated list colouring game on graphs
by: Gu, Yangyan, et al.
Published: (2025)

On Alon-Tarsi orientations of sparse graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

Truncated degree DP-colourability of $K_{2,4}$-minor free graphs
by: Lo, On-Hei Solomon, et al.
Published: (2023)

The maximum sum of sizes of non-empty cross $t$-intersecting families
by: Li, Shuang, et al.
Published: (2023)

Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
by: Kuffner, Luis, et al.
Published: (2024)

The double Hall property and cycle covers in bipartite graphs
by: Barát, János, et al.
Published: (2023)

Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)

Approximate cycle double cover
by: Ghanbari, Babak, et al.
Published: (2025)

Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
by: Liu, Chang, et al.
Published: (2026)

On shortest products for nonnegative matrix mortality
by: Ryzhikov, Andrew
Published: (2024)

The cycle double cover conjecture from the perspective of percolation theory on iterated line graphs
by: Fischer, Jens Walter
Published: (2023)

Bounds on the game isolation number and exact values for paths and cycles
by: Bujtás, Csilla, et al.
Published: (2025)

Graphs with span 1 and shortest optimal walks
by: Dravec, Tanja, et al.
Published: (2024)

Relations between average shortest path length and another centralities in graphs
by: Tuzhilin, Mikhail
Published: (2024)

Tropical cycles of discrete admissible covers
by: Bargans, Diego A. Robayo
Published: (2025)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Bounded diameter monochromatic component covers
by: Pokrovskiy, Alexey
Published: (2025)

Ramsey numbers of long even cycles versus books
by: Lin, Qizhong, et al.
Published: (2025)

Planar Turán number of two adjacent cycles
by: Song, Xinzhe, et al.
Published: (2024)

Triangles in graphs without the expansion of $4$-cycle
by: Song, Jialei, et al.
Published: (2026)

A Tighter Upper Bound for the Number of Distinct Squares in Circular Words
by: Li, Shuo, et al.
Published: (2026)

To cover a permutohedron
by: Kong, Bochao, et al.
Published: (2025)

Local network evolution rules drive shortest path multiplicity
by: Vazquez, Alexei
Published: (2026)

Support-sensitive bounds for shortest zero-sum subsequences
by: Pop, Claudiu, et al.
Published: (2025)

Optimal $L(d,1)$-labeling of certain direct graph bundles cycles over cycles and Cartesian graph bundles cycles over cycles
by: Ladinek, Irena Hrastnik
Published: (2024)