Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
Fuente:
arXiv
Guardado en:
| Autores principales: | Deng, Kecai, Qiu, Hongyuan |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Regular graphs are universally 3-edge-weightable
por: Deng, Kecai
Publicado: (2026)
por: Deng, Kecai
Publicado: (2026)
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)
Proper conflict-free degree-choosability of outerplanar graphs
por: Kashima, Masaki, et al.
Publicado: (2025)
por: Kashima, Masaki, et al.
Publicado: (2025)
All graphs are majority 3-choosable
por: Ouborny, Jan, et al.
Publicado: (2025)
por: Ouborny, Jan, 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)
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)
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)
Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
por: Bradshaw, Peter, et al.
Publicado: (2024)
por: Bradshaw, Peter, et al.
Publicado: (2024)
Minimal abundant packings and choosability with separation
por: Furedi, Zoltan, et al.
Publicado: (2013)
por: Furedi, Zoltan, et al.
Publicado: (2013)
Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable
por: Bi, Richard, et al.
Publicado: (2024)
por: Bi, Richard, et al.
Publicado: (2024)
Claw-free cubic graphs are $(1, 1, 2, 2)$-colorable
por: Brešar, Boštjan, et al.
Publicado: (2024)
por: Brešar, Boštjan, et al.
Publicado: (2024)
A method to optimize antipodal coloring span of graphs and its application
por: Kumar, Kush, et al.
Publicado: (2025)
por: Kumar, Kush, et al.
Publicado: (2025)
An Erdos-Gallai conjecture for signed graphs
por: Wang, Lujia
Publicado: (2025)
por: Wang, Lujia
Publicado: (2025)
On a conjecture concerning 4-coloring of graphs with one crossing
por: Dvořák, Zdeněk, et al.
Publicado: (2025)
por: Dvořák, Zdeněk, et al.
Publicado: (2025)
Odd Hadwiger's conjecture for the complements of Kneser graphs
por: Chen, Meirun, et al.
Publicado: (2025)
por: Chen, Meirun, et al.
Publicado: (2025)
Berge's conjecture for cubic graphs with small colouring defect
por: Karabáš, Ján, et al.
Publicado: (2022)
por: Karabáš, Ján, et al.
Publicado: (2022)
Counterexamples to two conjectures on mean color numbers of graphs
por: Zhai, Wushuang, et al.
Publicado: (2024)
por: Zhai, Wushuang, et al.
Publicado: (2024)
Regular colouring defect of a cubic graph and the conjectures of Fan-Raspaud and Fulkerson
por: Karabáš, Ján, et al.
Publicado: (2023)
por: Karabáš, Ján, et al.
Publicado: (2023)
Vu's conjecture holds for claw-free graphs
por: Cook, Linda, et al.
Publicado: (2025)
por: Cook, Linda, et al.
Publicado: (2025)
Topology of a uniform spanning tree on a cylinder
por: Kalinin, Nikita, et al.
Publicado: (2026)
por: Kalinin, Nikita, et al.
Publicado: (2026)
On a conjecture about the strong odd chromatic number of planar graphs
por: Manattu, Arun J, et al.
Publicado: (2026)
por: Manattu, Arun J, et al.
Publicado: (2026)
Reconfiguration graph for vertex colorings for ($P_2$+$P_3$, $C_4$)-free graphs
por: Belavadi, M., et al.
Publicado: (2025)
por: Belavadi, M., et al.
Publicado: (2025)
$S$-packing colorings of distance graphs with distance sets of cardinality $2$
por: Brešar, Boštjan, et al.
Publicado: (2024)
por: Brešar, Boštjan, et al.
Publicado: (2024)
Normal 6-edge-colorings of cubic graphs with oddness 2
por: Fabrici, Igor, et al.
Publicado: (2025)
por: Fabrici, Igor, et al.
Publicado: (2025)
Odd complete bipartite minors in graphs with independence number two
por: Chen, Rong, et al.
Publicado: (2025)
por: Chen, Rong, et al.
Publicado: (2025)
Color $2$-switches and neighborhood $λ$-balanced graphs with $k$ colors
por: Collins, Karen L., et al.
Publicado: (2026)
por: Collins, Karen L., et al.
Publicado: (2026)
Some results on 2-distance coloring of planar graphs with girth five
por: Deniz, Zakir
Publicado: (2023)
por: Deniz, Zakir
Publicado: (2023)
2-distance 20-coloring of planar graphs with maximum degree 6
por: Aoki, Kengo
Publicado: (2024)
por: Aoki, Kengo
Publicado: (2024)
On 2-distance 16-coloring of planar graphs with maximum degree at most five
por: Deniz, Zakir
Publicado: (2023)
por: Deniz, Zakir
Publicado: (2023)
Cubic graphs of colouring defect 3 and conjectures of Berge and Alon-Tarsi
por: Karabáš, Ján, et al.
Publicado: (2025)
por: Karabáš, Ján, et al.
Publicado: (2025)
Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
por: Wang, Tao, et al.
Publicado: (2025)
por: Wang, Tao, et al.
Publicado: (2025)
Vertex-partitions of 2-edge-colored graphs
por: Bang-Jensen, Jørgen, et al.
Publicado: (2025)
por: Bang-Jensen, Jørgen, et al.
Publicado: (2025)
On Borodin-Kostochka conjecture for correspondence coloring
por: Dvořák, Zdeněk, et al.
Publicado: (2026)
por: Dvořák, Zdeněk, et al.
Publicado: (2026)
Perfect divisions in ($P_2 \cup P_4$, bull)-free graphs
por: Chen, Lizhong, et al.
Publicado: (2025)
por: Chen, Lizhong, et al.
Publicado: (2025)
On the analogue of Esperet's conjecture: Characterizing hereditary classes
por: Rahimi, N., et al.
Publicado: (2025)
por: Rahimi, N., et al.
Publicado: (2025)
On $4$-covers of cubic graphs with two adjacent odd circuits in a $2$-factor
por: Karabáš, Ján, et al.
Publicado: (2026)
por: Karabáš, Ján, et al.
Publicado: (2026)
Odd coloring of 2-boundary planar graphs and beyond
por: Liu, Weichan, et al.
Publicado: (2022)
por: Liu, Weichan, et al.
Publicado: (2022)
On two conjectures of Hoàng
por: Chen, Hongzhang, et al.
Publicado: (2026)
por: Chen, Hongzhang, et al.
Publicado: (2026)
Non-conflicting no-where zero $Z_2\times Z_2$ flows in cubic graphs
por: Mkrtchyan, Vahan
Publicado: (2024)
por: Mkrtchyan, Vahan
Publicado: (2024)
Ejemplares similares
-
Regular graphs are universally 3-edge-weightable
por: Deng, Kecai
Publicado: (2026) -
Every signed planar graph is $5$-choosable: A short proof and refinements
por: Atangana, Pie Desire Ebode, et al.
Publicado: (2026) -
Proper conflict-free degree-choosability of outerplanar graphs
por: Kashima, Masaki, et al.
Publicado: (2025) -
All graphs are majority 3-choosable
por: Ouborny, Jan, et al.
Publicado: (2025) -
Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
por: Kashima, Masaki, et al.
Publicado: (2025)