Improving an upper bound on the size of \(k\)-regular induced subgraphs
type: Item
instance of: scholarly article
title: Improving an upper bound on the size of \(k\)-regular induced subgraphs
zbMATH Open document ID: 1263.90117
author: Carlos J. Luz
published in: Journal of Combinatorial Optimization
publication date: 2012-04-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6021882
zbMATH Keywords: graphs
zbMATH Keywords: independent sets
zbMATH Keywords: induced matchings
zbMATH Keywords: combinatorial optimization
describes a project that uses: SDPT3
MaRDI profile type: Publication
full work available at URL: s10878-010-9345-3
OpenAlex ID: W2165108720
cites work: Maximum \(k\)-regular induced subgraphs
cites work: Q3996569
cites work: Geometric algorithms and combinatorial optimization
cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization
cites work: The sandwich theorem
cites work: On the Shannon capacity of a graph
cites work: An upper bound on the independence number of a graph computable in polynomial-time
cites work: A Convex Quadratic Characterization of the Lovász Theta Number
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
DOI: 10.1007/S10878-010-9345-3
description: scientific article; zbMATH DE number 6021882