A Bruhat order for bipartite graphs whose node sets are posets: Lifting, switching, and adding edges

DOI10.1007/BF00563526zbMath0698.06001MaRDI QIDQ912137

Alexander Kovačec

Publication date: 1989

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

liftswitchfilterBruhat orderseries-parallel posetbipartite multigraphdeltoidlinear poset

Mathematics Subject Classification ID

Partial orders, general (06A06) Searching and sorting (68P10) Graph theory (05C99)

Cites Work

• Unnamed Item
• Classical Bruhat orders and lexicographic shellability
• Transversal theory. An account of some aspects of combinatorial mathematics
• On positive definite differences of multilinear forms and their representation
• Some Concepts of Dependence

This page was built for publication: A Bruhat order for bipartite graphs whose node sets are posets: Lifting, switching, and adding edges