Cliques in the union of graphs

DOI10.1016/j.jctb.2015.04.004zbMath1315.05096OpenAlexW2013883188MaRDI QIDQ2349513

Juba Ziani, Maria Chudnovsky, Eli Berger, Ron Aharoni

Publication date: 22 June 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2015.04.004

zbMATH Keywords

cliqueschordal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Red-blue clique partitions and \((1-1)\)-transversals ⋮ Cliques in the union of \(C_4\)-free graphs

Cites Work

• Transversals of 2-intervals, a topological approach
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• KKM -- a topological approach for trees
• On Representatives of Subsets

This page was built for publication: Cliques in the union of graphs