Imagen de Portada

Flexible list colorings: Maximizing the number of requests satisfied

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kaul, Hemanshu, Mathew, Rogers, Mudrock, Jeffrey A., Pelsmajer, Michael J.
Formato:	Preprint
Publicado:	2022
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 colorings: Maximizing the number of requests satisfied
por: Hemanshu Kaul, et al.
Publicado: (2024)

Counting Packings of List-colorings of Graphs
por: Kaul, Hemanshu, et al.
Publicado: (2024)

A Note on Fractional DP-Coloring of Graphs
por: Dominik, Daniel, et al.
Publicado: (2019)

List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
por: Kaul, Hemanshu, et al.
Publicado: (2025)

Counting List Colorings of Unlabeled Graphs
por: Kaul, Hemanshu, et al.
Publicado: (2024)

On the DP-chromatic Number of Cartesian Products of Critical Graphs
por: Kaul, Hemanshu, et al.
Publicado: (2025)

Shameful Inequalities for List and DP Coloring of Graphs
por: Kaul, Hemanshu, et al.
Publicado: (2024)

DP-Coloring of Graphs from Random Covers
por: Bernshteyn, Anton, et al.
Publicado: (2023)

A Polynomial Method for Counting Colorings of Sparse Graphs
por: Dahlberg, Samantha L., et al.
Publicado: (2023)

On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
por: Halberg, Charlie, et al.
Publicado: (2020)

On Polynomial Representations of Dual DP Color Functions
por: Mudrock, Jeffrey A., et al.
Publicado: (2024)

Enumerative Chromatic Choosability
por: Allred, Sarah, et al.
Publicado: (2025)

Fractional Strict Degeneracy of Graphs
por: Dominik, Daniel, et al.
Publicado: (2026)

Maximizing Satisfied Vertex Requests in List Coloring
por: Bennett, Timothy, et al.
Publicado: (2024)

An Ohba-like Result for Flexible List Coloring
por: Bowdoin, Michael C., et al.
Publicado: (2025)

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

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

Enumeratively Chromatic-Choosable Theta Graphs
por: Chi, Yanghong, et al.
Publicado: (2026)

On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs
por: Cano, Kennedy, et al.
Publicado: (2024)

Results on proper conflict-free list coloring of graphs
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)

On the chromatic number of the plane for map-type colorings
por: Sokolov, Georgy, et al.
Publicado: (2025)

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

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
por: Dong, Fengming, et al.
Publicado: (2023)

Upper bounds for the list-distinguishing chromatic number
por: Banerjee, Amitayu, et al.
Publicado: (2024)

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

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
por: Dong, Fengming, et al.
Publicado: (2022)

A Spectral Turán Problem for a Fixed Tree
por: Desai, Dheer Noal, et al.
Publicado: (2025)

The number of distinguishing colorings of a Cartesian product graph
por: Alikhani, Saeid, et al.
Publicado: (2021)

Counterexamples to two conjectures on mean color numbers of graphs
por: Zhai, Wushuang, et al.
Publicado: (2024)

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

Asymptotic number of edge-colored regular graphs
por: Borinsky, Michael, et al.
Publicado: (2026)

The list chromatic number of the intersection of two generalized partition matroids
por: Guo, He
Publicado: (2024)

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

The wild number of an edge-colored graph
por: Anders, Katie, et al.
Publicado: (2025)

On Borodin-Kostochka conjecture for correspondence coloring
por: Dvořák, Zdeněk, et al.
Publicado: (2026)

$5$-list-coloring toroidal $6$-regular triangulations in linear time
por: Balachandran, Niranjan, et al.
Publicado: (2021)

Perfect colorings of hypergraphs
por: Taranenko, Anna A.
Publicado: (2022)

On harmonious coloring of hypergraphs
por: Czerwiński, Sebastian
Publicado: (2022)

Coloring, list coloring, and fractional coloring in intersections of matroids
por: Aharoni, Ron, et al.
Publicado: (2024)