Badly-covered graphs

DOI10.1016/J.DAM.2013.11.004MaRDI QIDQ2255048zbMATH OpenOpenAlexFDO

Authors Márcia R. Cappelle, Felix Joos, Janina Müttel, Dieter Rautenbach

Publication date 6 February 2015

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

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

zbMATH Keywords

cliquemaximal independent setwell-covered graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The maximal number of induced \(r\)-partite subgraphs
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Maximizing the number of independent sets of fixed size in Kn‐covered graphs
• Coverings, matchings and the number of maximal independent sets of graphs
• A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs

Cites work

• On cliques in graphs
• On cliques in graphs
• On cliques in graphs
• Some covering concepts in graphs

This page was built for publication: Badly-covered graphs

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