A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs

DOI10.1137/19M1272111zbMath1450.05028OpenAlexW3088906884MaRDI QIDQ5128500

Fei Huang, Jinjiang Yuan, Shan-Shan Guo

Publication date: 27 October 2020

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

Full work available at URL: https://doi.org/10.1137/19m1272111

zbMATH Keywords

matchingconflict-free coloringfactor-critical graphopen neighborhood

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Conflict-free coloring bounds on open neighborhoods ⋮ On odd colorings of planar graphs ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods ⋮ Conflict-free coloring: graphs of bounded clique width and intersection graphs

Cites Work

• Complexity of conflict-free colorings of graphs
• Conflict-free coloring of unit disks
• Conflict-Free Colourings of Graphs and Hypergraphs
• Conflict-Free Coloring Made Stronger
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-Free Coloring of Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs