Proper conflict-free coloring of graphs with large maximum degree
type: Item
instance of: scholarly article
title: Proper conflict-free coloring of graphs with large maximum degree
author: Daniel W. Cranston
author: Chun-Hung Liu
published in: SIAM Journal on Discrete Mathematics
publication date: 2024-12-18T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7959405
zbMATH Keywords: conflict-free hypergraph coloring
zbMATH Keywords: proper graph coloring
zbMATH Keywords: maximum degree
MaRDI profile type: MaRDI publication profile
cites work: Acyclic coloring of graphs
cites work: Real zeros and partitions without singleton blocks
cites work: Remarks on proper conflict-free colorings of graphs
cites work: Proper conflict-free coloring of sparse graphs
cites work: Acyclic edge-coloring using entropy compression
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
cites work: Star coloring of graphs
cites work: Q6072045
cites work: Colouring a graph frugally
cites work: Conflict-free colourings of uniform hypergraphs with few edges
cites work: Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
cites work: Linear colorings of subcubic graphs
cites work: Conflict-Free Colourings of Graphs and Hypergraphs
cites work: Another approach to non-repetitive colorings of graphs of bounded degree
cites work: A General Framework for Hypergraph Coloring
cites work: Linear coloring of graphs
DOI: 10.1137/23M1563281
description: scientific article; zbMATH DE number 7959405