Pages that link to "Item:Q2019513"

From MaRDI portal

← Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513)

Jump to:navigation, search

The following pages link to Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513):

Displaying 2 items.

Characterization of saturated graphs related to pairs of disjoint matchings (Q2135642) (← links)
Pairs of disjoint matchings and related classes of graphs (Q6117063) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere"