Another look at the degree constrained subgraph problem (Q1167739): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(81)90009-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016856039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for edge coloring bipartite graphs / rank
 
Normal rank

Latest revision as of 15:32, 13 June 2024

scientific article
Language Label Description Also known as
English
Another look at the degree constrained subgraph problem
scientific article

    Statements

    Another look at the degree constrained subgraph problem (English)
    0 references
    1981
    0 references
    matching problem
    0 references
    constrained subgraph problem
    0 references
    0 references

    Identifiers