Strong cliques and equistability of EPT graphs

DOI10.1016/j.dam.2015.09.016zbMath1332.05042MaRDI QIDQ260014

F. Blanchet-Sadri, M. Dambrine

Publication date: 18 March 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.016

zbMATH Keywords

triangle condition; EPT graph; equistable graph; general partition graph; strong clique; triangle graph

Mathematics Subject Classification ID

05C38: Paths and cycles

05C12: Distance in graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C76: Graph operations (line graphs, products, etc.)