Isomorphism of two infinite-chromatic triangle-free graphs

DOI10.1016/0012-365X(88)90181-1MaRDI QIDQ1124601zbMATH OpenFDO

Authors Zsolt Tuza

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberinfinite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 4134067 (Why is no real title available?)
• scientific article; zbMATH DE number 3316912 (Why is no real title available?)
• Still another triangle-free infinite-chromatic graph

Cited in

(2)

• scientific article; zbMATH DE number 89183 (Why is no real title available?)
• Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy

This page was built for publication: Isomorphism of two infinite-chromatic triangle-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124601)