The binding number of a graph and its cliques
type: Item
instance of: scholarly article
title: The binding number of a graph and its cliques
zbMATH Open document ID: 1227.05206
author: Jeremy Lyle
author: Wayne Goddard
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
full work available at URL: https://aquila.usm.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5702650
zbMATH Keywords: binding number
zbMATH Keywords: \(K_r\)-free graphs
MaRDI profile type: Publication
OpenAlex ID: W2103671165
cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph
cites work: Note on the structure of graphs with bounded clique number
cites work: Triangle-Free Graphs with Large Degree
cites work: A note on maximal triangle‐free graphs
cites work: Dense graphs with small clique number
cites work: Q3933026
cites work: Triangles and neighbourhoods of independent sets in graphs
cites work: The binding number of a graph and its pancyclism
cites work: The binding number of a graph and its triangle
cites work: The binding number of a graph and its Anderson number
DOI: 10.1016/J.DAM.2009.06.014
description: scientific article; zbMATH DE number 5702650