Cover Image

Degree-choosability of proper conflict-free list coloring of sparse graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kashima, Masaki, Škrekovski, Riste, Xu, Rongxing
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Normal 5-edge-coloring of some snarks superpositioned by Flower snarks
by: Sedlar, Jelena, et al.
Published: (2023)

Proper Z4 x Z2-colorings: structural characterization with application to some snarks
by: Sedlar, Jelena, et al.
Published: (2024)

A note on vertex-critical induced subgraphs of shift graphs
by: Kaiser, Tomáš, et al.
Published: (2026)

The odd independence number of graphs, I: Foundations and classical classes
by: Caro, Yair, et al.
Published: (2025)

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

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

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)

Odd coloring of $k$-trees
by: Kashima, Masaki, et al.
Published: (2025)

Criticality in Sperner's Lemma
by: Kaiser, Tomáš, et al.
Published: (2023)

Degree sum conditions and a 2-factor with a bounded number of cycles in claw-free graphs
by: Kashima, Masaki
Published: (2025)

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

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

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

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)

On regular graphs with Šoltés vertices
by: Bašić, Nino, et al.
Published: (2023)

The subpath number of cactus graphs
by: Knor, Martin, et al.
Published: (2025)

Domination number of modular product graphs
by: Bermudo, Sergio, et al.
Published: (2024)

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)

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

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

Counting geodesic paths in graphs
by: Knor, Martin, et al.
Published: (2026)

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

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

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

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

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

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

On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2024)

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

New type degree conditions for a graph to have a 2-factor
by: Kashima, Masaki
Published: (2025)

Fault tolerance of metric basis can be expensive
by: Knor, Martin, et al.
Published: (2024)

A note on the number of non-cycle components in a pseudo 2-factor of graphs
by: Kashima, Masaki
Published: (2025)

On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2026)

Claw-free cubic graphs are $(1, 1, 2, 2)$-colorable
by: Brešar, Boštjan, et al.
Published: (2024)

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

Some results on $σ_{t}$-irregularity
by: Filipovski, Slobodan, et al.
Published: (2024)