Conflict‐free chromatic number versus conflict‐free chromatic index

DOI10.1002/jgt.22743zbMath1528.05022arXiv2009.02239MaRDI QIDQ6057644

Michał Dębski, Jakub Przybyło

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

line graphsconflict-free chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Conflict-free coloring bounds on open neighborhoods ⋮ A note on the conflict-free chromatic index ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods

Cites Work

• Unnamed Item
• Colouring graphs when the number of colours is almost the maximum degree
• On a problem of Spencer
• Conflict-free coloring of intersection graphs of geometric objects
• Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
• Conflict-Free Colourings of Graphs and Hypergraphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-Free Coloring and its Applications
• Conflict-Free Colouring of Graphs
• Graph colouring and the probabilistic method

This page was built for publication: Conflict‐free chromatic number versus conflict‐free chromatic index