Imagen de Portada

Counting Packings of List-colorings of Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kaul, Hemanshu, Mudrock, Jeffrey A.
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics 05C15, 05C30
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Shameful Inequalities for List and DP Coloring of 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)

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

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

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

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

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

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

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)

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

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

DP color functions of hypergraphs
por: Cui, Ruiyi, et al.
Publicado: (2025)

List Packing and Correspondence Packing of Planar Graphs
por: Cranston, Daniel W., et al.
Publicado: (2024)

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

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

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

Distinguishing Polynomials of Graphs
por: Haghighi, Mohammad Hassan Shirdareh, et al.
Publicado: (2024)

Automated Counting of Spanning Trees for Several Infinite Families of Graphs
por: Blanco, Pablo, et al.
Publicado: (2025)

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

Exploring the Influence of Graph Operations on Zero Forcing Sets
por: Menon, Krishna, et al.
Publicado: (2024)

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

Extending the Affirmative Action Problem: mixing numbers and integrated colorings of graphs
por: Burnette, Charles, et al.
Publicado: (2025)

Counting subgraphs of coloring graphs
por: Asgarli, Shamil, et al.
Publicado: (2024)

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

Sperner's colorings of hypergraphs arising from edgewise triangulations
por: Jojić, Duško, et al.
Publicado: (2025)

Grundy Packing Coloring of Graphs
por: Gözüpek, Didem, et al.
Publicado: (2024)

Average Hitting Times and Recurrence Structures I: Powers of Cycle Graphs
por: Miezaki, Tsuyoshi, et al.
Publicado: (2026)

Counting Colored Trees
por: Dimitrov, Stoyan, et al.
Publicado: (2026)

Gallai-Ramsey multiplicity for rainbow small trees
por: Li, Xueliang, et al.
Publicado: (2023)

Algorithms for the Generation of Snarks
por: Brinkmann, Gunnar, et al.
Publicado: (2026)

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

Colourings of Uniform Group Divisible Designs and Maximum Packings
por: Burgess, Andrea C, et al.
Publicado: (2025)

On the minimal forts of trees
por: Cameron, Thomas R., et al.
Publicado: (2025)

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

Partial Petrial Polynomials of Ribbon Graphs
por: Yu, Xiaoxiang, et al.
Publicado: (2026)

Uniquely 2-colourable 4-cycle decompositions
por: Burgess, Andrea C., et al.
Publicado: (2026)

Polynomials Counting Group Colorings in Graphs
por: Fu, Houshan
Publicado: (2024)

Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words
por: Allagan, Julian
Publicado: (2026)