Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Maximum directed cuts in acyc...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Maximum directed cuts in acyclic digraphs
Bibliographic Details
Main Authors:
Alon, N
,
Bollobás, B
,
Gyárfás, A
,
Lehel, J
,
Scott, A
Format:
Journal article
Published:
2007
Holdings
Description
Similar Items
Staff View
Similar Items
Acyclic Subgraphs of Planar Digraphs
by: Golowich, Noah, et al.
Published: (2015)
On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-01-01)
New Applied Problems in the Theory of Acyclic Digraphs
by: Gurami Tsitsiashvili, et al.
Published: (2021-12-01)
On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-04-01)
Existence of acyclic matching and Morse complex on transitive digraphs
by: Chong Wang, et al.
Published: (2025-01-01)