Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375)

From MaRDI portal
scientific article; zbMATH DE number 7805290
Language Label Description Also known as
English
Parallel connectivity in edge-colored complete graphs: complexity results
scientific article; zbMATH DE number 7805290

    Statements

    Parallel connectivity in edge-colored complete graphs: complexity results (English)
    0 references
    0 references
    15 February 2024
    0 references
    edge-colored complete graphs
    0 references
    parallel connectivity
    0 references
    approximation
    0 references
    Eulerian subgraphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references