Triangles and neighbourhoods of independent sets in graphs
DOI10.1006/JCTB.2000.1974zbMATH Open1023.05087OpenAlexW2015893985MaRDI QIDQ1850489FDOQ1850489
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
triangle-free graphpancyclic[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn+graphs&go=Go Tur��n graphs]binding numberconjecture of Caroneighbourhood condition
Cites Work
- Title not available (Why is that?)
- The binding number of a graph and its Anderson number
- Perfect matchings of a graph
- A sufficient condition for Hamiltonian circuits
- k -Factors and Neighbourhoods of Independent Sets in Graphs
- The binding number of a graph and its pancyclism
- The binding number of a graph and its triangle
- A note on maximal triangle‐free graphs
Cited In (7)
- Title not available (Why is that?)
- 1-Triangle graphs and perfect neighborhood sets
- Title not available (Why is that?)
- Best monotone degree conditions for graph properties: a survey
- Independent triangles covering given vertices of a graph
- The binding number of a graph and its cliques
- Independent dominating and neighborhood sets in triangular graphs
This page was built for publication: Triangles and neighbourhoods of independent sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850489)
