Graphs whose every independent set has a common neighbour

DOI10.1016/0012-365X(81)90221-1MaRDI QIDQ1158445zbMATH OpenOpenAlexFDO

Authors János Pach

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

zbMATH Keywords

triangle-free graphsindependent vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites work

• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• An extremal problem in graph theory
• Graph Theory and Probability. II
• On Graphs that do not Contain a Thomsen Graph
• On the construction of certain graphs

Cited in

(9)

• On existentially complete triangle-free graphs
• Triangle-free graphs and forbidden subgraphs
• Convex-round graphs are circular-perfect
• Cycle-maximal triangle-free graphs
• Triply existentially complete triangle-free graphs
• An analogue of Hajós' theorem for the circular chromatic number
• Graphs of odd girth 7 with large degree
• Triangle-free graphs whose independence number equals the degree
• Describing hereditary properties by forbidden circular orderings

This page was built for publication: Graphs whose every independent set has a common neighbour

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158445)