Jump number of dags having Dilworth number 2

DOI10.1016/0166-218X(84)90002-7zbMath0536.05034MaRDI QIDQ791537

Michel Chein, Michel A. Habib

Publication date: 1984

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

zbMATH Keywords

jump numberacyclic digraphDilworth numberhamiltonian path

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (8)

A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders ⋮ Greedy posets for the bump-minimizing problem ⋮ Minimizing bumps for posets of width two ⋮ On minimizing jumps for ordered sets ⋮ The jump number of Z-free ordered sets ⋮ Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings ⋮ Minimizing setups in ordered sets of fixed width ⋮ Ordered sets with small width and large jump number

Cites Work

• The Jump Number of Dags and Posets: An Introduction
• Minimizing Setups for Cycle-Free Ordered Sets
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Jump number of dags having Dilworth number 2