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

DOI10.1016/j.disc.2005.11.024zbMath1103.05065OpenAlexW1993424457MaRDI QIDQ2495511

Han Hyuk Cho, Suh-Ryung Kim, Jung Yeun Lee

Publication date: 30 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.024

zbMATH Keywords

chordal graphedge clique cover number\(m\)th power of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Applications of edge coverings by cliques
• On powers and centers of chordal graphs
• Graphs whose squares are chordal
• Graphs satisfying inequality \(\theta(G^2) \leq \theta(G)\)
• Dually Chordal Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\)