Cover Image

Flexible list coloring of graphs with maximum average degree less than $3$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bi, Richard, Bradshaw, Peter
Format:	Preprint
Published:	2023
Subjects:	Combinatorics 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable
by: Bi, Richard, et al.
Published: (2024)

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

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

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

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

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

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

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

Equitable list coloring of sparse graphs
by: Kierstead, H. A., et al.
Published: (2024)

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

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

Flexible list colorings: Maximizing the number of requests satisfied
by: Kaul, Hemanshu, et al.
Published: (2022)

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

Results on proper conflict-free list coloring of graphs
by: Kashima, Masaki, et al.
Published: (2025)

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

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

Degree-choosability of proper conflict-free list coloring of sparse graphs
by: Kashima, Masaki, et al.
Published: (2026)

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

Hat guessing number and guaranteed subgraphs
by: Bradshaw, Peter
Published: (2021)

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

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

Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
by: Fang, Shu, et al.
Published: (2026)

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

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

Total coloring of regular graphs of girth = degree + 1
by: Dejter, Italo J.
Published: (2024)

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

Strong majority colorings of graphs
by: Kalinowski, Rafał, et al.
Published: (2026)

Counting subgraphs of coloring graphs
by: Asgarli, Shamil, et al.
Published: (2024)

On the interval coloring impropriety of graphs
by: Carr, MacKenzie, et al.
Published: (2023)

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

On odd colorings of sparse graphs
by: Wang, Tao, et al.
Published: (2022)

Reconfiguration graph for vertex colorings for ($P_2$+$P_3$, $C_4$)-free graphs
by: Belavadi, M., et al.
Published: (2025)

Strong odd coloring of sparse graphs
by: Kwon, Hyemin, et al.
Published: (2024)

The DP-coloring of the square of subcubic graphs
by: Zhao, Ren
Published: (2024)

Reconfiguration graphs for vertex colorings of $P_5$-free graphs
by: Lei, Hui, et al.
Published: (2024)

Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)

On the 3-colorability of triangle-free and fork-free graphs
by: Schroeder, Joshua, et al.
Published: (2021)

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

Injective (edge) colorings of generalized Sierpiński graphs
by: Bhanupriya, C. K., et al.
Published: (2025)

Star edge coloring of generalized Petersen graphs
by: Dastjerdi, Behnaz Omoomi Marzieh Vahid
Published: (2024)