Mathematical Foundations of Computer Science 2004

DOI10.1007/b99679zbMath1096.68123OpenAlexW2488008928MaRDI QIDQ5311107

Raphael Yuster, Zeev Nutov

Publication date: 22 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Decomposing oriented graphs into transitive tournaments

This page was built for publication: Mathematical Foundations of Computer Science 2004