Orthogonal structures in directed graphs

DOI10.1006/JCTB.1993.1023MaRDI QIDQ1325244zbMATH OpenOpenAlexFDO

Authors 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

antichain familieschain familiescyclesdigraphsfinite posetsGreene-Kleitman theoryminimal cost flow algorithmnetworksorthogonal structuresorthogonalitypartitionpathsTheorem of GreeneTheorem of Greene and Kleitman

Mathematics Subject Classification ID

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

Recommendations

• Orthogonal representations and connectivity of graphs
• On orthogonal representations of graphs
• Orthogonal labelings of graphs
• Orthogonal systems in finite graphs
• A note on orthogonal graphs
• Orthogonal factorizations of graphs
• Orthogonal factorizations of graphs
• scientific article; zbMATH DE number 124514
• Orthogonal factorizations of graphs

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325244)