On the small graphs with chromatic number 5 without 4-cliques

DOI10.1016/S0012-365X(98)00083-1MaRDI QIDQ1584347zbMATH OpenFDO

Authors Nedyalko Nenov

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(98)00083-1

zbMATH Keywords

chromatic numbersmall graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

Letter to the editor.

Recommendations

• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques
• Small graphs with chromatic number 5: A computer search
• The size of a minimum five-chromatic \(K_ 4\)-free graph
• scientific article; zbMATH DE number 4137784
• The chromatic number of \(\{P_5,K_4\}\)-free graphs
• On the chromaticity of 5-partite graphs with \(5n+4\) vertices
• On the chromatic number of some \(P_5\)-free graphs
• Small clique and large chromatic number
• Group chromatic number of graphs without \(K_5\)-minors
• On graphs with small subgraphs of large chromatic number

Cites work

• 25 pretty graph colouring problems
• scientific article; zbMATH DE number 3838052 (Why is no real title available?)
• scientific article; zbMATH DE number 3871392 (Why is no real title available?)
• The size of a minimum five-chromatic \(K_ 4\)-free graph

Cited in

(5)

• On the triangle vertex Folkman numbers
• On the nonexistence of some generalized Folkman numbers
• scientific article; zbMATH DE number 3885942 (Why is no real title available?)
• On the vertex Folkman numbers \(F_v(\underbrace{2,\dots,2}_R;R-1)\) and \(F_v(\underbrace{2,\dots,2}_R;R-2)\)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques

This page was built for publication: On the small graphs with chromatic number 5 without 4-cliques

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