Cliques in the union of graphs

DOI10.1016/J.JCTB.2015.04.004zbMATH Open1315.05096OpenAlexW2013883188MaRDI QIDQ2349513FDOQ2349513

Authors: Eli Berger, Maria Chudnovsky, Juba Ziani, 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

Recommendations

• Cliques in the union of \(C_4\)-free graphs
• Another note on cliques and independent sets
• Ramsey-type results for unions of comparability graphs
• How many graphs are unions of k‐cliques?
• Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs

zbMATH Keywords

chordal graphscliques

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)

Cites Work

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

Cited In (2)

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

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

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