Complete graphs without polychromatic circuits
type: Item
instance of: scholarly article
title: Complete graphs without polychromatic circuits
zbMATH Open document ID: 0513.05028
DOI: 10.1016/0012-365X(83)90263-7
author: N. G. Bate
published in: Discrete Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3809582
zbMATH Keywords: monochromatic subgraph
zbMATH Keywords: edge-colored complete graphs
zbMATH Keywords: polychromatic circuits
MaRDI profile type: Publication
cites work: On a problem of C. C. Chen and D. E. Daykin
cites work: 2-colored triangles in edge-colored complete graphs. II
cites work: On the structure of complete graphs without alternating cycles
cites work: Q4075490
cites work: Q3853641
cites work: More star sub-Ramsey numbers
full work available at URL: 0012-365x(83)90263-7
OpenAlex ID: W1984387652
description: scientific article; zbMATH DE number 3809582