A note on generalized pentagons

DOI10.1016/j.disc.2010.04.017zbMath1225.05092OpenAlexW2068394760MaRDI QIDQ709327

Stephan Brandt

Publication date: 18 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.017

zbMATH Keywords

chromatic numbertriangle-free graphCarsten Thomassengeneralized pentagon

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• On the chromatic number of triangle-free graphs of large minimum degree
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the chromatic number of pentagon-free graphs of large minimum degree
• On a valence problem in extremal graph theory
• Triangle-Free Graphs with High Minimal Degrees

This page was built for publication: A note on generalized pentagons