On the jump number problem in hereditary classes of bipartite graphs
From MaRDI portal
Publication:5935840
DOI10.1023/A:1006437630359zbMath0987.05088OpenAlexW130424845MaRDI QIDQ5935840
Michael U. Gerber, Vadim V. Lozin
Publication date: 2000
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1006437630359
Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
On unicyclic graphs with uniquely restricted maximum matchings ⋮ Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ NP-hard graph problems and boundary classes of graphs ⋮ Chordal bipartite graphs of bounded tree- and clique-width ⋮ Unicycle graphs and uniquely restricted maximum matchings
This page was built for publication: On the jump number problem in hereditary classes of bipartite graphs
