Triangle-free graphs and forbidden subgraphs
type: Item
instance of: scholarly article
title: Triangle-free graphs and forbidden subgraphs
zbMATH Open document ID: 1003.05039
DOI: 10.1016/S0166-218X(01)00277-3
author: Stephan Brandt
published in: Discrete Applied Mathematics
publication date: 2002-08-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1792309
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
cites work: Über ein Extremalproblem der Graphentheorie
cites work: Graph Classes: A Survey
cites work: On the Structure of Dense Triangle-Free Graphs
cites work: Q4865614
cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
cites work: Graph Theory and Probability
cites work: Q4063176
cites work: Q5749319
cites work: The core of a graph
cites work: Radius two trees specify χ‐bounded classes
cites work: The Ramsey number R(3, t) has order of magnitude t2/log t
cites work: Dominating subgraphs in graphs with some forbidden structures
cites work: Graphs whose every independent set has a common neighbour
cites work: Q4252433
cites work: Three-colourability and forbidden subgraphs. II: Polynomial algorithms
cites work: On a property of the class of n-colorable graphs
cites work: Q3932997
cites work: A bound on the chromatic number of graphs without certain induced subgraphs
full work available at URL: s0166-218x(01)00277-3
OpenAlex ID: W2066158472
description: scientific article; zbMATH DE number 1792309