Maximum weighted induced subgraphs

DOI10.1016/J.DISC.2015.07.013MaRDI QIDQ279221zbMATH OpenOpenAlexFDO

Authors Jochen Harant, S. Mohr

Publication date 27 April 2016

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

weighted independenceweighted induced subgraph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Weights of induced subgraphs in \(K_{1,r}\)-free graphs
• On \({\mathcal F}\)-independence in graphs
• On vertex-induced weighted Turán problems
• scientific article; zbMATH DE number 139776
• Publication:3469129

Cites work

• A note on greedy algorithms for the maximum weighted independent set problem
• Continuous Characterizations of the Maximum Clique Problem
• Evolution towards the maximum clique
• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Stable sets and polynomials
• The maximum clique problem

Cited in

(3)

• On \({\mathcal F}\)-independence in graphs
• Weights of induced subgraphs in \(K_{1,r}\)-free graphs
• The Maximum Weight Connected Subgraph Problem

This page was built for publication: Maximum weighted induced subgraphs

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