Imagen de Portada

Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bi, Richard, Bradshaw, Peter
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics 05C15
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Flexible list coloring of graphs with maximum average degree less than $3$
por: Bi, Richard, et al.
Publicado: (2023)

Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
por: Bradshaw, Peter, et al.
Publicado: (2024)

Proper conflict-free degree-choosability of outerplanar graphs
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)

Cliques in Squares of Graphs with Maximum Average Degree less than 4
por: Cranston, Daniel W., et al.
Publicado: (2023)

All graphs are majority 3-choosable
por: Ouborny, Jan, 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)

Hat guessing number and guaranteed subgraphs
por: Bradshaw, Peter
Publicado: (2021)

On the hat guessing number of a planar graph class
por: Bradshaw, Peter
Publicado: (2021)

Minimal abundant packings and choosability with separation
por: Furedi, Zoltan, et al.
Publicado: (2013)

Total coloring graphs with large maximum degree
por: Dalal, Aseem, et al.
Publicado: (2024)

Degree-choosability of proper conflict-free list coloring of sparse graphs
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)

Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
por: Deng, Kecai, et al.
Publicado: (2025)

2-distance 20-coloring of planar graphs with maximum degree 6
por: Aoki, Kengo
Publicado: (2024)

Every signed planar graph is $5$-choosable: A short proof and refinements
por: Atangana, Pie Desire Ebode, et al.
Publicado: (2026)

On 2-distance 16-coloring of planar graphs with maximum degree at most five
por: Deniz, Zakir
Publicado: (2023)

Flexible DP 3-coloring of sparse multigraphs
por: Bradshaw, Peter, et al.
Publicado: (2025)

Paintability of $r$-chromatic graphs
por: Bradshaw, Peter, et al.
Publicado: (2024)

Strong parity edge-colorings of graphs
por: Bradshaw, Peter, et al.
Publicado: (2024)

A lower bound on the number of edges in DP-critical graphs
por: Bradshaw, Peter, et al.
Publicado: (2024)

Single-conflict colorings of degenerate graphs
por: Bradshaw, Peter, et al.
Publicado: (2021)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
por: Bradshaw, Peter, et al.
Publicado: (2024)

Nordhaus-Gaddum-type theorems for maximum average degree
por: Caro, Yair, et al.
Publicado: (2025)

Rainbow Connection for Complete Multipartite Graphs
por: Araujo, Igor, et al.
Publicado: (2022)

Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
por: Noguchi, Kenta
Publicado: (2019)

On polynomial degree-boundedness
por: Bourneuf, Romain, et al.
Publicado: (2023)

$(2,4)$-Colorability of Planar Graphs Excluding $3$-, $4$-, and $6$-Cycles
por: Sittitrai, Pongpat, et al.
Publicado: (2025)

Total coloring graphs with large minimum degree
por: Henderschedt, Owen, et al.
Publicado: (2025)

On maximum spectral radius of $\{H(3,3),~H(4,3)\}$-free graphs
por: Rehman, Amir, et al.
Publicado: (2024)

Strong edge-coloring of graphs with maximum edge weight seven
por: Wang, Runze
Publicado: (2025)

Tight minimum colored degree condition for rainbow connectivity
por: Czygrinow, Andrzej, et al.
Publicado: (2024)

Chip games and multipartite graph paintability
por: Bradshaw, Peter, et al.
Publicado: (2024)

Structure, Perfect Divisibility and Coloring of ($P_2\cup P_4, C_3$)-Free Graphs
por: Chen, Ran, et al.
Publicado: (2025)

Strong edge-coloring of sparse graphs with Ore-degree 7 or 8
por: Wang, Runze
Publicado: (2026)

Acyclic and complete coloring of digraphs with the minimum and maximum possible numbers of colors
por: Olsen, Mika, et al.
Publicado: (2025)

Spanning trees with large maximum degrees
por: Yan, Jun
Publicado: (2025)

On an Erdős--Lov'asz problem: 3-critical 3-graphs of minimum degree 7
por: Li, Ruiliang
Publicado: (2025)

Backbone coloring for graphs with degree 4
por: Michalik, Krzysztof, et al.
Publicado: (2024)

Cops and robbers on directed and undirected abelian Cayley graphs
por: Bradshaw, Peter, et al.
Publicado: (2019)