Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
type: Item
instance of: scholarly article
title: Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
zbMATH Open document ID: 1236.05091
published in: Combinatorica
publication date: 2008-10-21T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5355069
Wikidata QID: Q123151409
author: Stéphane Bessy
author: Stéphan Thomassé
MaRDI profile type: Publication
full work available at URL: s00493-007-2073-3
OpenAlex ID: W1981468140
cites work: Path Partitions in Directed Graphs
cites work: Q4871748
cites work: A short proof of the Chen-Manalastas theorem
cites work: Diconnected Orientations and a Conjecture of Las Vergnas
cites work: Q3267901
cites work: Every finite strongly connected digraph of stability 2 has a Hamiltonian path
cites work: A decomposition theorem for partially ordered sets
cites work: Q5544082
cites work: Q3283482
cites work: Circular chromatic number: A survey
DOI: 10.1007/S00493-007-2073-3
description: scientific article; zbMATH DE number 5355069