Classes of intersection digraphs with good algorithmic properties

From MaRDI portal

(Redirected from Classes of intersection digraphs with good algorithmic properties)
Classes of intersection digraphs with good algorithmic properties (scientific article; zbMATH DE number 7836605)

Jump to:navigation, search

DOI10.4230/LIPICS.STACS.2022.38MaRDI QIDQ6490984zbMATH OpenFDO

Authors Lars Jaffke, O-joung Kwon, Jan Arne Telle

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.38

zbMATH Keywords

\(H\)-digraphs directed \(H\)-homomorphism directed domination intersection digraphs reflexive digraphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

Counting kernels in directed graphs with arbitrary orientations

This page was built for publication: Classes of intersection digraphs with good algorithmic properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490984)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Classes_of_intersection_digraphs_with_good_algorithmic_properties_(scientific_article;_zbMATH_DE_number_7836605)&oldid=103503449"