Orthogonal structures in directed graphs

DOI10.1006/JCTB.1993.1023zbMATH Open0794.05034OpenAlexW2015060188MaRDI QIDQ1325244FDOQ1325244

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

networksorthogonalitypartitionpathsdigraphsfinite posetscyclesorthogonal structuresantichain familieschain familiesGreene-Kleitman theoryminimal cost flow algorithmTheorem of GreeneTheorem of Greene and Kleitman

Mathematics Subject Classification ID

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

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
• Finite posets and Ferrers shapes
• On the maximum even factor in weakly symmetric graphs
• Weighted Rooted Trees: Fat or Tall?
• Research problems
• Distinguishing orthogonality graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Orthogonal representations and connectivity of graphs 👍 👎
• Orthogonal factorizations of graphs 👍 👎
• Orthogonal factorizations of graphs 👍 👎
• Orthogonal systems in finite graphs 👍 👎
• On orthogonal representations of graphs 👍 👎
• Orthogonal factorizations of graphs 👍 👎
• A note on orthogonal 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)