Orthogonal structures in directed graphs

DOI10.1006/jctb.1993.1023zbMath0794.05034OpenAlexW2015060188MaRDI QIDQ1325244

Stefan Felsner

Publication date: 28 August 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6d48ac20ab46678a6b7735142db8d57d5d34fac2

zbMATH Keywords

partitionpathscyclesnetworksdigraphsorthogonalityfinite posetsorthogonal structuresantichain familieschain familiesGreene-Kleitman theoryminimal cost flow algorithmTheorem of GreeneTheorem of Greene and Kleitman

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Weighted Rooted Trees: Fat or Tall? ⋮ On the maximum even factor in weakly symmetric graphs ⋮ Matchings of cycles and paths in directed graphs ⋮ Finite posets and Ferrers shapes ⋮ Research problems ⋮ Path Partitions, Cycle Covers and Integer Decomposition

This page was built for publication: Orthogonal structures in directed graphs