Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximum \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the independence number of a graph computable in polynomial-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convex Quadratic Characterization of the Lovász Theta Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank

Latest revision as of 01:57, 5 July 2024

scientific article
Language Label Description Also known as
English
Improving an upper bound on the size of \(k\)-regular induced subgraphs
scientific article

    Statements

    Identifiers