Pages that link to "Item:Q2019513"
From MaRDI portal
The following pages link to Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513):
Displaying 5 items.
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Characterization of saturated graphs related to pairs of disjoint matchings (Q2135642) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)
- Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs (Q2911495) (← links)
- Pairs of disjoint matchings and related classes of graphs (Q6117063) (← links)