The \(k\)-regular induced subgraph problem (Q1786867): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.01.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2590296153 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57736457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in intersection graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral upper bounds on the size of k-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral upper bounds for the order of a \(k\)-regular induced subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New insights on integer-programming models for the kidney exchange problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5648382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the independence number in terms of the degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds on the order, size, and stability number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of antiwebs to independence systems and their canonical facets / 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: Laplacian spectral bounds for clique and independence numbers of graphs / 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: Improving an upper bound on the size of \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total unimodularity of edge-edge adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eigenvalues of a Graph and Its Chromatic Number / rank
 
Normal rank

Latest revision as of 16:45, 16 July 2024

scientific article
Language Label Description Also known as
English
The \(k\)-regular induced subgraph problem
scientific article

    Statements

    The \(k\)-regular induced subgraph problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    regular induced graphs
    0 references
    strong-matchings
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    0 references
    0 references