Image de couverture de livre

Bound on shortest cycle covers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Song, Deping, Zhu, Xuding
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
par: Xu, Xiaoyan, et autres
Publié: (2025)

A survey on Hedetniemi's conjecture
par: Zhu, Xuding
Publié: (2025)

Minimum non-chromatic-choosable graphs with given chromatic number
par: Zhu, Jialu, et autres
Publié: (2022)

On graphs coverable by chubby shortest paths
par: Hatzel, Meike, et autres
Publié: (2025)

Truncated degree AT-orientations of outerplanar graphs
par: Deng, Chenglong, et autres
Publié: (2024)

Odd 4-coloring of outerplanar graphs
par: Kashima, Masaki, et autres
Publié: (2024)

List colouring triangle free planar graphs
par: Hu, Jianzhang, et autres
Publié: (2019)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
par: Jin, Ligang, et autres
Publié: (2024)

Arc weighted acyclic orientations and variations of degeneracy of graphs
par: Zhou, Huan, et autres
Publié: (2023)

Degree-truncated choosability of graphs
par: Zhou, Huan, et autres
Publié: (2025)

On graphs coverable by k shortest paths
par: Dumas, Maël, et autres
Publié: (2022)

List packing of graphs with bounded tree-width
par: Kashima, Masaki, et autres
Publié: (2026)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
par: Baste, Julien, et autres
Publié: (2025)

Degree-truncated choosability of planar graphs
par: Jiang, Yiting, et autres
Publié: (2024)

Number of edges with shortest cycle k in a Kautz graph
par: Faber, Vance
Publié: (2025)

Indicated list colouring game on graphs
par: Gu, Yangyan, et autres
Publié: (2025)

On Alon-Tarsi orientations of sparse graphs
par: Cho, Eun-Kyung, et autres
Publié: (2025)

Truncated degree DP-colourability of $K_{2,4}$-minor free graphs
par: Lo, On-Hei Solomon, et autres
Publié: (2023)

The maximum sum of sizes of non-empty cross $t$-intersecting families
par: Li, Shuang, et autres
Publié: (2023)

Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
par: Kuffner, Luis, et autres
Publié: (2024)

The double Hall property and cycle covers in bipartite graphs
par: Barát, János, et autres
Publié: (2023)

Facial diagrams and cycle double cover
par: Ghanbari, Babak, et autres
Publié: (2026)

Approximate cycle double cover
par: Ghanbari, Babak, et autres
Publié: (2025)

Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
par: Liu, Chang, et autres
Publié: (2026)

On shortest products for nonnegative matrix mortality
par: Ryzhikov, Andrew
Publié: (2024)

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

Bounds on the game isolation number and exact values for paths and cycles
par: Bujtás, Csilla, et autres
Publié: (2025)

Graphs with span 1 and shortest optimal walks
par: Dravec, Tanja, et autres
Publié: (2024)

Relations between average shortest path length and another centralities in graphs
par: Tuzhilin, Mikhail
Publié: (2024)

Tropical cycles of discrete admissible covers
par: Bargans, Diego A. Robayo
Publié: (2025)

Bounds on treewidth via excluding disjoint unions of cycles
par: Hatzel, Meike, et autres
Publié: (2025)

Bounded diameter monochromatic component covers
par: Pokrovskiy, Alexey
Publié: (2025)

Ramsey numbers of long even cycles versus books
par: Lin, Qizhong, et autres
Publié: (2025)

Planar Turán number of two adjacent cycles
par: Song, Xinzhe, et autres
Publié: (2024)

Triangles in graphs without the expansion of $4$-cycle
par: Song, Jialei, et autres
Publié: (2026)

A Tighter Upper Bound for the Number of Distinct Squares in Circular Words
par: Li, Shuo, et autres
Publié: (2026)

To cover a permutohedron
par: Kong, Bochao, et autres
Publié: (2025)

Local network evolution rules drive shortest path multiplicity
par: Vazquez, Alexei
Publié: (2026)

Support-sensitive bounds for shortest zero-sum subsequences
par: Pop, Claudiu, et autres
Publié: (2025)

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