The Gallai-Younger conjecture for planar graphs
type: Item
instance of: scholarly article
title: The Gallai-Younger conjecture for planar graphs
zbMATH Open document ID: 0880.05071
DOI: 10.1007/BF01271273
published in: Combinatorica
publication date: 1998-01-07T00:00:00Z
review text: Younger conjectured that for every \(k\) there is a \(g(k)\) such that any digraph without \(k\) vertex disjoint cycles contains a set of at most \(g(k)\) vertices whose removal leaves an acyclic digraph. (This has previously been conjectured by Gallai for \(k=1\).) The authors prove this for planar digraphs. More recently the general conjecture has been resolved by Reed, Robertson, Seymour and Thomas.
reviewed by: András Recski
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1101403
Wikidata QID: Q123305356
author: Bruce Reed
author: F. Bruce Shepherd
MaRDI profile type: Publication
cites work: A note on short cycles in digraphs
cites work: Q4273847
cites work: Disjoint cycles in digraphs
full work available at URL: https://doi.org/10.1007/bf01271273
OpenAlex ID: W1980526181
description: scientific article; zbMATH DE number 1101403