The binding number of a graph and its cliques

DOI10.1016/j.dam.2009.06.014zbMath1227.05206OpenAlexW2103671165MaRDI QIDQ967391

Wayne Goddard, Jeremy Lyle

Publication date: 28 April 2010

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

Full work available at URL: https://aquila.usm.edu/cgi/viewcontent.cgi?article=2148&context=fac_pubs

zbMATH Keywords

binding number\(K_r\)-free graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Best monotone degree conditions for binding number ⋮ Binding Number and Wheel Related Graphs ⋮ Best monotone degree conditions for graph properties: a survey

Cites Work

• Unnamed Item
• The binding number of a graph and its pancyclism
• The binding number of a graph and its triangle
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Triangles and neighbourhoods of independent sets in graphs
• Note on the structure of graphs with bounded clique number
• Dense graphs with small clique number
• A note on maximal triangle‐free graphs
• Triangle-Free Graphs with Large Degree
• The binding number of a graph and its Anderson number

This page was built for publication: The binding number of a graph and its cliques