Computing kernels in directed bichromatic graphs

DOI10.1016/S0020-0190(97)00035-5zbMATH Open1336.68206MaRDI QIDQ287022FDOQ287022

Authors: Burghard von Karger, Rudolf Berghammer 

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

directed graphsbipartitenessbichromaticitycomputing kernelsrelation algebraRichardson's theorem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Games involving graphs (91A43) Cylindric and polyadic algebras; relation algebras (03G15)

Cites Work

• Title not available (Why is that?)
• Solutions of irreflexive relations
• A lattice-theoretical fixpoint theorem and its applications
• Title not available (Why is that?)
• On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints
• Fixed-point calculus

Cited In (3)

• Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
• Using relation-algebraic means and tool support for investigating and computing bipartitions
• Applying relational algebra and REL VIEW to coalition formation

This page was built for publication: Computing kernels in directed bichromatic graphs

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