Degree-truncated choosability of graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Zhou, Huan, Zhu, Jialu, Zhu, Xuding |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Degree-truncated choosability of planar graphs
por: Jiang, Yiting, et al.
Publicado: (2024)
por: Jiang, Yiting, et al.
Publicado: (2024)
Minimum non-chromatic-choosable graphs with given chromatic number
por: Zhu, Jialu, et al.
Publicado: (2022)
por: Zhu, Jialu, et al.
Publicado: (2022)
Arc weighted acyclic orientations and variations of degeneracy of graphs
por: Zhou, Huan, et al.
Publicado: (2023)
por: Zhou, Huan, et al.
Publicado: (2023)
Indicated list colouring game on graphs
por: Gu, Yangyan, et al.
Publicado: (2025)
por: Gu, Yangyan, et al.
Publicado: (2025)
Truncated degree AT-orientations of outerplanar graphs
por: Deng, Chenglong, et al.
Publicado: (2024)
por: Deng, Chenglong, et al.
Publicado: (2024)
Odd 4-coloring of outerplanar graphs
por: Kashima, Masaki, et al.
Publicado: (2024)
por: Kashima, Masaki, et al.
Publicado: (2024)
List colouring triangle free planar graphs
por: Hu, Jianzhang, et al.
Publicado: (2019)
por: Hu, Jianzhang, et al.
Publicado: (2019)
Truncated degree DP-colourability of $K_{2,4}$-minor free graphs
por: Lo, On-Hei Solomon, et al.
Publicado: (2023)
por: Lo, On-Hei Solomon, et al.
Publicado: (2023)
Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
por: Xu, Xiaoyan, et al.
Publicado: (2025)
por: Xu, Xiaoyan, et al.
Publicado: (2025)
Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
por: Kuffner, Luis, et al.
Publicado: (2024)
por: Kuffner, Luis, et al.
Publicado: (2024)
A survey on Hedetniemi's conjecture
por: Zhu, Xuding
Publicado: (2025)
por: Zhu, Xuding
Publicado: (2025)
Degree-choosability of proper conflict-free list coloring of sparse graphs
por: Kashima, Masaki, et al.
Publicado: (2026)
por: Kashima, Masaki, et al.
Publicado: (2026)
List packing of graphs with bounded tree-width
por: Kashima, Masaki, et al.
Publicado: (2026)
por: Kashima, Masaki, et al.
Publicado: (2026)
Bound on shortest cycle covers
por: Song, Deping, et al.
Publicado: (2024)
por: Song, Deping, et al.
Publicado: (2024)
On Alon-Tarsi orientations of sparse graphs
por: Cho, Eun-Kyung, et al.
Publicado: (2025)
por: Cho, Eun-Kyung, et al.
Publicado: (2025)
Weak diameter choosability of graphs with an excluded minor
por: Crouch, Joshua, et al.
Publicado: (2023)
por: Crouch, Joshua, et al.
Publicado: (2023)
Generalized Petersen graphs are (1,3)-choosable
por: Tang, Yunfang, et al.
Publicado: (2024)
por: Tang, Yunfang, et al.
Publicado: (2024)
Single conflict coloring, adaptable choosability and separation choosability
por: Casselgren, Carl Johan, et al.
Publicado: (2025)
por: Casselgren, Carl Johan, et al.
Publicado: (2025)
Proper conflict-free choosability of planar graphs
por: Wang, Yuting, et al.
Publicado: (2025)
por: Wang, Yuting, et al.
Publicado: (2025)
Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
por: Jin, Ligang, et al.
Publicado: (2024)
por: Jin, Ligang, et al.
Publicado: (2024)
All graphs are majority 3-choosable
por: Ouborny, Jan, et al.
Publicado: (2025)
por: Ouborny, Jan, et al.
Publicado: (2025)
Some results on total weight choosability
por: Wu, T., et al.
Publicado: (2024)
por: Wu, T., et al.
Publicado: (2024)
Proper conflict-free degree-choosability of outerplanar graphs
por: Kashima, Masaki, et al.
Publicado: (2025)
por: Kashima, Masaki, et al.
Publicado: (2025)
Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
por: Kashima, Masaki, et al.
Publicado: (2025)
por: Kashima, Masaki, et al.
Publicado: (2025)
The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
por: Jin, Ligang, et al.
Publicado: (2025)
por: Jin, Ligang, et al.
Publicado: (2025)
Minimum Non‐Chromatic‐λ‐Choosable Graphs
por: Jialu Zhu, et al.
Publicado: (2025)
por: Jialu Zhu, et al.
Publicado: (2025)
The square of a subcubic planar graph without a 5-cycle is 7-choosable
por: Kim, Seog-Jin, et al.
Publicado: (2025)
por: Kim, Seog-Jin, et al.
Publicado: (2025)
Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
por: Kim, Seog-Jin, et al.
Publicado: (2025)
por: Kim, Seog-Jin, et al.
Publicado: (2025)
Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
por: Deng, Kecai, et al.
Publicado: (2025)
por: Deng, Kecai, et al.
Publicado: (2025)
Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
por: Bradshaw, Peter, et al.
Publicado: (2024)
por: Bradshaw, Peter, et al.
Publicado: (2024)
A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026)
por: Bastida, Sam, et al.
Publicado: (2026)
Minimal abundant packings and choosability with separation
por: Furedi, Zoltan, et al.
Publicado: (2013)
por: Furedi, Zoltan, et al.
Publicado: (2013)
Every signed planar graph is $5$-choosable: A short proof and refinements
por: Atangana, Pie Desire Ebode, et al.
Publicado: (2026)
por: Atangana, Pie Desire Ebode, et al.
Publicado: (2026)
Brooks' theorem for signed graphs with $Δ=3$
por: Naserasr, Reza, et al.
Publicado: (2025)
por: Naserasr, Reza, et al.
Publicado: (2025)
Degree sequence condition for Hamiltonicity in tough graphs
por: Shan, Songling, et al.
Publicado: (2024)
por: Shan, Songling, et al.
Publicado: (2024)
Degree-similar graphs and cospectral graphs
por: Fan, Yi-Zheng, et al.
Publicado: (2025)
por: Fan, Yi-Zheng, et al.
Publicado: (2025)
Symmetry properties of generalized graph truncations
por: Eiben, Eduard, et al.
Publicado: (2017)
por: Eiben, Eduard, et al.
Publicado: (2017)
Degree 2 vertices in minimal prime graph complements
por: Alvarez, Bryan, et al.
Publicado: (2025)
por: Alvarez, Bryan, et al.
Publicado: (2025)
Degree powers and number of stars in graphs with a forbidden broom
por: Gerbner, Dániel
Publicado: (2024)
por: Gerbner, Dániel
Publicado: (2024)
Bilateral truncated quintuple product
por: Qu, Wenxia, et al.
Publicado: (2025)
por: Qu, Wenxia, et al.
Publicado: (2025)
Ejemplares similares
-
Degree-truncated choosability of planar graphs
por: Jiang, Yiting, et al.
Publicado: (2024) -
Minimum non-chromatic-choosable graphs with given chromatic number
por: Zhu, Jialu, et al.
Publicado: (2022) -
Arc weighted acyclic orientations and variations of degeneracy of graphs
por: Zhou, Huan, et al.
Publicado: (2023) -
Indicated list colouring game on graphs
por: Gu, Yangyan, et al.
Publicado: (2025) -
Truncated degree AT-orientations of outerplanar graphs
por: Deng, Chenglong, et al.
Publicado: (2024)