On subgraph number independence in trees
type: Item
instance of: scholarly article
title: On subgraph number independence in trees
zbMATH Open document ID: 0389.05028
DOI: 10.1016/0095-8956(78)90022-9
author: Ron Graham
author: Endre Szemerédi
published in: Journal of Combinatorial Theory. Series B
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 3604919
MaRDI profile type: Publication
full work available at URL: 0095-8956(78)90022-9
OpenAlex ID: W2133075223
cites work: On the distance matrix of a tree
cites work: Q5572939
Recommended article: Independence number and \(k\)-trees of graphs
Recommended article: On the number of induced subgraphs of trees
Recommended article: On the number of independent subsets in trees with restricted degrees
Recommended article: On \(k\)-independence in graphs with emphasis on trees
Recommended article: Q4039257
Recommended article: On the number of subtrees for almost all graphs
Recommended article: On graphs with subgraphs having large independence numbers
Recommended article: On the number of independent sets in a tree
Recommended article: On the \(k\)-component independence number of a tree
description: scientific article; zbMATH DE number 3604919