Edge colorings avoiding patterns

DOI10.1016/j.ejc.2023.103825OpenAlexW4386968458MaRDI QIDQ6181991

Michał Dębski

Publication date: 23 January 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2023.103825

Mathematics Subject Classification ID

Discrete geometry (52Cxx) Graph theory (05Cxx) Extremal combinatorics (05Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variant of the classical Ramsey problem
• Covering and coloring polygon-circle graphs
• A generalized Ramsey problem
• Blocking visibility for points in general position
• Acyclic edge-coloring using entropy compression
• On the chromatic number of the visibility graph of a set of points in the plane
• Acyclic edge colorings of graphs
• On visibility and blockers
• A constructive proof of the general lovász local lemma
• Acyclic coloring of graphs
• New approach to nonrepetitive sequences
• Star Chromatic Index

This page was built for publication: Edge colorings avoiding patterns