Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract) - MaRDI portal

Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract) (Q6496545)

From MaRDI portal
scientific article; zbMATH DE number 7842206
Language Label Description Also known as
English
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
scientific article; zbMATH DE number 7842206

    Statements

    title
    Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract) (English)
    0 references
    author
    Jan Bok
    0 references
    Jiří Fiala
    0 references
    Nikola Jedličková
    0 references
    Jan Kratochvíl
    0 references
    Michaela Seifrtová
    0 references
    publication date
    3 May 2024
    0 references
    cites work
    Q4017175
    0 references
    Q4770409
    0 references
    Q3922710
    0 references
    Q6168434
    0 references
    Q3416074
    0 references
    Q4474120
    0 references
    Q3439665
    0 references
    Modular operads
    0 references
    Compatible 2-factors
    0 references
    Q4373685
    0 references
    Q4281656
    0 references
    Q2810314
    0 references

    Identifiers

    zbMATH DE Number
    7842206
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6496545&oldid=38017027"
    Powered by MediaWiki