Triangles and neighbourhoods of independent sets in graphs

DOI10.1006/jctb.2000.1974zbMath1023.05087OpenAlexW2015893985MaRDI QIDQ1850489

Andrew M. Robertshaw, Douglas R. Woodall

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1974

zbMATH Keywords

triangle-free graphpancyclicTurán graphsbinding numberconjecture of Caroneighbourhood condition

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

Best monotone degree conditions for graph properties: a survey ⋮ The binding number of a graph and its cliques

Cites Work

• The binding number of a graph and its pancyclism
• The binding number of a graph and its triangle
• A sufficient condition for Hamiltonian circuits
• Perfect matchings of a graph
• k -Factors and Neighbourhoods of Independent Sets in Graphs
• A note on maximal triangle‐free graphs
• The binding number of a graph and its Anderson number
• Unnamed Item

This page was built for publication: Triangles and neighbourhoods of independent sets in graphs