Quasi-kernels and quasi-sinks in infinite graphs

DOI10.1016/j.disc.2008.08.006zbMath1208.05033arXiv0712.0663OpenAlexW1982480622MaRDI QIDQ1025921

Péter L. Erdős, Lajos Soukup

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.0663

zbMATH Keywords

quasi-kernelinfinite directed graphquasi-sink

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)

Related Items (3)

Infinite kernel perfect digraphs ⋮ King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments ⋮ On the existence of \((k,l)\)-kernels in infinite digraphs: a survey

Cites Work

• Unnamed Item
• About quasi-kernels in a digraph
• Semikernels and (k,l)-Kernels in Digraphs
• On the number of quasi-kernels in digraphs

This page was built for publication: Quasi-kernels and quasi-sinks in infinite graphs