Triangle-free graphs whose independence number equals the degree
type: Item
instance of: scholarly article
title: Triangle-free graphs whose independence number equals the degree
zbMATH Open document ID: 1216.05097
author: Stephan Brandt
published in: Discrete Mathematics
publication date: 2010-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5687602
zbMATH Keywords: triangle-free graph
zbMATH Keywords: independence number
zbMATH Keywords: fractional chromatic number
zbMATH Keywords: toughness
MaRDI profile type: Publication
full work available at URL: j.disc.2009.05.021
OpenAlex ID: W2061073878
cites work: A note on Ramsey numbers
cites work: Tough Ramsey graphs without short cycles
cites work: Toughness and triangle-free graphs
cites work: Q4373673
cites work: A 4-colour problem for dense triangle-free graphs
cites work: Another infinite sequence of dense triangle-free graphs
cites work: Q4865614
cites work: Toughness and spectrum of a graph
cites work: Tough graphs and Hamiltonian circuits.
cites work: Q4342632
cites work: Graph Theory and Probability
cites work: Q3201067
cites work: Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
cites work: ODD Cycles of Specified Length in Non-Bipartite Graphs
cites work: The Ramsey number R(3, t) has order of magnitude t2/log t
cites work: Families of Non-disjoint subsets
cites work: The fractional chromatic number of mycielski's graphs
cites work: Graphs whose every independent set has a common neighbour
cites work: A note on the independence number of triangle-free graphs
cites work: Triangle-free regular graphs
cites work: Q4382863
cites work: Q4156812
cites work: Q4869540
DOI: 10.1016/J.DISC.2009.05.021
description: scientific article; zbMATH DE number 5687602