Pages that link to "Item:Q805638"

From MaRDI portal

← Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638)

Jump to:navigation, search

The following pages link to Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638):

Displaying 1 item.

A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)

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