Triangles and neighbourhoods of independent sets in graphs

DOI10.1006/JCTB.2000.1974MaRDI QIDQ1850489zbMATH OpenOpenAlexFDO

Authors 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 graphpancyclicbinding numberconjecture of Caroneighbourhood conditionTurán graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 1409190
• A neighborhood union condition for pancyclic graphs
• k -Factors and Neighbourhoods of Independent Sets in Graphs
• A conjecture on triangles of graphs
• scientific article; zbMATH DE number 1782221

Cites work

• scientific article; zbMATH DE number 914171 (Why is no real title available?)
• k -Factors and Neighbourhoods of Independent Sets in Graphs
• A note on maximal triangle‐free graphs
• A sufficient condition for Hamiltonian circuits
• Perfect matchings of a graph
• The binding number of a graph and its Anderson number
• The binding number of a graph and its pancyclism
• The binding number of a graph and its triangle

Cited in

(8)

• Independent dominating and neighborhood sets in triangular graphs
• Best monotone degree conditions for graph properties: a survey
• Independent triangles covering given vertices of a graph
• 1-Triangle graphs and perfect neighborhood sets
• scientific article; zbMATH DE number 3851144 (Why is no real title available?)
• Isolation of cycles
• The binding number of a graph and its cliques
• scientific article; zbMATH DE number 4212113 (Why is no real title available?)

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)