scientific article

From MaRDI portal

Revision as of 07:41, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3679238

Jump to:navigation, search

zbMath0565.05060MaRDI QIDQ3679238

Dieter Kratsch, Andreas Brandstädt

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-complete problems permutation graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (4)

A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders ⋮ Bipartite permutation graphs ⋮ Dominating sets in perfect graphs ⋮ Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3679238&oldid=17151813"