High Chromatic Rigid Graphs II

DOI10.1016/S0304-0208(08)73252-3zbMath0502.05052OpenAlexW36824309MaRDI QIDQ3967570

Jaroslav Nešetřil, László Babai

Publication date: 1982

Published in: North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73252-3

zbMATH Keywords

clique numbersrigid graphendomorphism of a graphrepresentations of categories of graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Chromatically optimal rigid graphs ⋮ On the order of countable graphs ⋮ A surprising permanence of old motivations (a not-so-rigid story)