A combinatorial bijection between linear extensions of equivalent orders

DOI10.1016/0012-365X(86)90147-0zbMath0596.06002MaRDI QIDQ1078213

Ulrich Faigle, Rainer Schrader

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

posetscomparability graphlinear extensions

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (05C99)

Related Items

Computing the bump number is easy, Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm, Hamiltonian cycle is polynomial on cocomparability graphs, Jump number maximization for proper interval graphs and series-parallel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparability invariance of the fixed point property
• Partially ordered sets and their comparability graphs
• A Fast Algorithm for the Decomposition of Graphs and Posets
• The Dimension of Finite and Infinite Comparability Graphs
• The Dimension of a Comparability Graph
• Transitiv orientierbare Graphen
• Ordered structures and partitions