Nash-Williams' cycle-decomposition theorem
From MaRDI portal
Publication:1714950
DOI10.1007/s00493-016-3424-8zbMath1413.05195OpenAlexW2347102462WikidataQ56926508 ScholiaQ56926508MaRDI QIDQ1714950
Publication date: 1 February 2019
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/8a2bdb34-1746-43fd-83c4-67e07ca84616
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Infinite graphs (05C63)
Related Items
The Lovász-Cherkassky theorem in countable graphs ⋮ On Partitioning the Edges of an Infinite Digraph into Directed Cycles
