Remarks on proper conflict-free colorings of graphs

DOI10.1016/j.disc.2022.113221zbMath1504.05085arXiv2203.01088OpenAlexW4306856302MaRDI QIDQ2099465

Yair Caro, Riste Škrekovski, Mirko Petruševski

Publication date: 23 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.01088

zbMATH Keywords

planar graphneighborhoodconflict-free coloringproper coloringPCF chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ On odd colorings of planar graphs ⋮ Interpretable random forest model for identification of edge 3-uncolorable cubic graphs ⋮ On odd colorings of sparse graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A note on weak odd edge-colorings of graphs
• An introduction to the discharging method via graph coloring
• Graph unique-maximum and conflict-free colorings
• Injective colorings of sparse graphs
• Unique-maximum coloring of plane graphs
• On the maximum average degree and the oriented chromatic number of a graph
• On vertex-parity edge-colorings
• Decomposition of a graph into two disjoint odd subgraphs
• Light edges in degree-constrained graphs
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• Odd decompositions and coverings of graphs
• Linear colorings of subcubic graphs
• The odd chromatic number of a planar graph is at most 8
• Odd coloring of sparse graphs and planar graphs
• A note on odd colorings of 1-planar graphs
• Odd edge-colorability of subcubic graphs
• Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
• On Complementary Graphs
• Odd edge coloring of graphs
• Conflict-Free Colourings of Graphs and Hypergraphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Odd 4‐edge‐colorability of graphs
• On Representatives of Subsets
• Conflict-Free Coloring and its Applications
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
• Conflict-Free Colouring of Graphs
• Homomorphisms of 2-edge-colored graphs
• On the hardness of approximating the chromatic number

This page was built for publication: Remarks on proper conflict-free colorings of graphs