Graphs satisfying inequality \(\theta(G^2) \leq \theta(G)\)

DOI10.1016/S0012-365X(01)00423-XzbMath1007.05078MaRDI QIDQ1613456

Suh-Ryung Kim, Yangmi Shin, Ilwon Kang, Yunsun Nam

Publication date: 29 August 2002

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

zbMATH Keywords

chordal graphedge clique cover numberthe square of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\)

This page was built for publication: Graphs satisfying inequality \(\theta(G^2) \leq \theta(G)\)