The Library
Bipartite induced subgraphs and well-quasi-ordering
Tools
Korpelainen, Nicholas and Lozin, Vadim V. (2011) Bipartite induced subgraphs and well-quasi-ordering. Journal of Graph Theory, Volume 67 (Number 3). pp. 235-249. doi:10.1002/jgt.20528 ISSN 0364-9024.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1002/jgt.20528
Abstract
We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to distinguish classes of bipartite graphs that are or are not well-quasi-ordered (wqo) by this relation. Answering an open question from [J Graph Theory 16 (1992), 489-502], we prove that P(7)-free bipartite graphs are not wqo. On the other hand, we show that P(6)-free bipartite graphs are wqo. We also obtain some partial results on subclasses of bipartite graphs defined by forbidding more than one induced subgraph. (C) 2011 Wiley Periodicals, Inc. J Graph Theory 67: 235-249, 2011
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Library of Congress Subject Headings (LCSH): | Bipartite graphs, Graph theory | ||||
Journal or Publication Title: | Journal of Graph Theory | ||||
Publisher: | John Wiley & Sons Ltd. | ||||
ISSN: | 0364-9024 | ||||
Official Date: | 2011 | ||||
Dates: |
|
||||
Volume: | Volume 67 | ||||
Number: | Number 3 | ||||
Page Range: | pp. 235-249 | ||||
DOI: | 10.1002/jgt.20528 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Funder: | University of Warwick |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |