Graphs whose every independent set has a common neighbour
From MaRDI portal
Publication:1158445
DOI10.1016/0012-365X(81)90221-1zbMath0473.05054OpenAlexW2029364854MaRDI QIDQ1158445
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(81)90221-1
Related Items (9)
Triangle-free graphs and forbidden subgraphs ⋮ On existentially complete triangle-free graphs ⋮ Cycle-maximal triangle-free graphs ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ Triangle-free graphs whose independence number equals the degree ⋮ Triply Existentially Complete Triangle‐Free Graphs ⋮ Graphs of odd girth 7 with large degree ⋮ Describing hereditary properties by forbidden circular orderings ⋮ Convex-round graphs are circular-perfect
Cites Work
This page was built for publication: Graphs whose every independent set has a common neighbour