On the jump number problem in hereditary classes of bipartite graphs

作     者：Lozin, VV Gerber, MU 

作者机构：Nizhny Novgorod Univ Nizhnii Novgorod 603600 Russia Swiss Fed Inst Technol Dept Math CH-1015 Lausanne Switzerland 

出 版 物：《ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS》 (序；有序集理论杂志)

年 卷 期：2000年第17卷第4期

页      面：377-385页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：bipartite graphs jump number polynomial algorithm 

摘      要：We prove a necessary condition for polynomial solvability of the jump number problem in classes of bipartite graphs characterized by a finite set of forbidden induced bipartite subgraphs. For some classes satisfying this condition, we propose polynomial algorithms to solve the jump number problem.