On first-order definable colorings
From MaRDI portal
Publication:3194868
DOI10.1007/978-88-7642-525-7_6zbMath1326.05049arXiv1403.1995OpenAlexW2132050408MaRDI QIDQ3194868
Jaroslav Nešetřil, Patrice Ossona de Mendez
Publication date: 20 October 2015
Published in: Geometry, Structure and Randomness in Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.1995
Coloring of graphs and hypergraphs (05C15) Applications of model theory (03C98) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (4)
The harmonic index of graphs based on some operations related to the lexicographic product ⋮ On low tree-depth decompositions ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes ⋮ Unnamed Item
This page was built for publication: On first-order definable colorings