A note on maximal triangle‐free graphs

DOI10.1002/jgt.3190170510zbMath0784.05034OpenAlexW2153072393MaRDI QIDQ4271620

Wayne Goddard, Daniel J. Kleitman

Publication date: 17 March 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170510

zbMATH Keywords

independent setneighborhoodsbinding numbermaximal triangle-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (6)

Dense graphs with small clique number ⋮ Binding Number, Minimum Degree, and Cycle Structure in Graphs ⋮ Distributed Nash equilibrium seeking in networked graphical games ⋮ The binding number of a graph and its cliques ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ Triangles and neighbourhoods of independent sets in graphs

This page was built for publication: A note on maximal triangle‐free graphs