Cover Image

Single conflict coloring, adaptable choosability and separation choosability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Casselgren, Carl Johan, Eriksson, Kalle
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Single conflict coloring and palette sparsification of uniform hypergraphs
by: Casselgren, Carl Johan, et al.
Published: (2026)

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

Proper conflict-free choosability of planar graphs
by: Wang, Yuting, et al.
Published: (2025)

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

Degree-truncated choosability of graphs
by: Zhou, Huan, et al.
Published: (2025)

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

Degree-truncated choosability of planar graphs
by: Jiang, Yiting, et al.
Published: (2024)

Some results on total weight choosability
by: Wu, T., et al.
Published: (2024)

Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
by: Kashima, Masaki, et al.
Published: (2025)

Weak diameter choosability of graphs with an excluded minor
by: Crouch, Joshua, et al.
Published: (2023)

Generalized Petersen graphs are (1,3)-choosable
by: Tang, Yunfang, et al.
Published: (2024)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)

Extending partial edge colorings of iterated cartesian products of cycles and paths
by: Casselgren, Carl Johan, et al.
Published: (2023)

The edge chromatic transformation index of graphs
by: Asratian, Armen S., et al.
Published: (2025)

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
by: Jin, Ligang, et al.
Published: (2025)

The square of a subcubic planar graph without a 5-cycle is 7-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

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

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

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

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

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

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

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
by: Anderson, James, et al.
Published: (2024)

On conflict-free colorings of cyclic polytopes and the girth conjecture for graphs
by: Lee, Seunghun, et al.
Published: (2024)

Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
by: Liu, Chun-Hung
Published: (2022)

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

A note on a cyclotomic-friendly application of RSK
by: Eriksson, Holden
Published: (2026)

Boundedness for proper conflict-free and odd colorings
by: Jiménez, Andrea, et al.
Published: (2023)

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
by: Ahn, Jungho, et al.
Published: (2022)

Embedding arbitrary edge-colorings of hypergraphs into regular colorings
by: Wang, Xiaomiao, et al.
Published: (2024)

Distributions of statistics on separable permutations
by: Chen, Joanna N., et al.
Published: (2024)

e-injective coloring: injective and 2-distance colorings conjectures
by: Mirdamad, Shahrzad Sadat, et al.
Published: (2024)

Generalized Ramsey numbers via conflict-free hypergraph matchings
by: Lane, Andrew, et al.
Published: (2024)

Six types of separable integer partitions
by: He, Thomas Y., et al.
Published: (2025)

On packing total coloring
by: Ferme, Jasmina, et al.
Published: (2025)

Cooperative colorings of hypergraphs
by: Bai, Xuqing, et al.
Published: (2024)

On the theory of Lucas coloring
by: Paul, Pravakar
Published: (2024)

The nonrepetitive colorings of grids
by: Tao, Tianyi
Published: (2023)