On the jump number problem in hereditary classes of bipartite graphs
From MaRDI portal
Publication:5935840
DOI10.1023/A:1006437630359zbMath0987.05088MaRDI 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
68Q25: Analysis of algorithms and problem complexity
06A07: Combinatorics of partially ordered sets
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings, Chordal bipartite graphs of bounded tree- and clique-width, Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids, NP-hard graph problems and boundary classes of graphs, On unicyclic graphs with uniquely restricted maximum matchings, Unicycle graphs and uniquely restricted maximum matchings