:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Song, Deping, Zhu, Xuding
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	https://arxiv.org/abs/2412.20874
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

A survey on Hedetniemi's conjecture
por: Zhu, Xuding
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Approximate cycle double cover
por: Ghanbari, Babak, et al.
Publicado: (2025)

On shortest products for nonnegative matrix mortality
por: Ryzhikov, Andrew
Publicado: (2024)

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

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

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

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

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

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

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

Bounded diameter monochromatic component covers
por: Pokrovskiy, Alexey
Publicado: (2025)

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

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

Local network evolution rules drive shortest path multiplicity
por: Vazquez, Alexei
Publicado: (2026)

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

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

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

On cycle covers of infinite bipartite graphs
por: Aurichi, Leandro, et al.
Publicado: (2025)

To cover a permutohedron
por: Kong, Bochao, et al.
Publicado: (2025)