Packing Dicycle Covers in Planar Graphs with No K 5–e Minor

DOI10.1007/11682462_62zbMath1145.05317OpenAlexW1528095446MaRDI QIDQ3525800

Aaron Williams, Orlando Lee

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_62

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Disjoint dijoins for classes of dicuts in finite and infinite digraphs ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs

This page was built for publication: Packing Dicycle Covers in Planar Graphs with No K 5–e Minor