Pages that link to "Item:Q1996748"

From MaRDI portal

← The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748)

Jump to:navigation, search

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748):

Displaying 1 item.

A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)

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