Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Brignall, Robert | ko |
| dc.contributor.author | Choi, Hojin | ko |
| dc.contributor.author | Jeong, Jisu | ko |
| dc.contributor.author | Oum, Sang-il | ko |
| dc.date.accessioned | 2019-04-15T14:13:42Z | - |
| dc.date.available | 2019-04-15T14:13:42Z | - |
| dc.date.created | 2019-04-08 | - |
| dc.date.created | 2019-04-08 | - |
| dc.date.issued | 2019-03 | - |
| dc.identifier.citation | DISCRETE APPLIED MATHEMATICS, v.257, pp.60 - 66 | - |
| dc.identifier.issn | 0166-218X | - |
| dc.identifier.uri | http://hdl.handle.net/10203/253966 | - |
| dc.description.abstract | A homogeneous set of a graph G is a set X of vertices such that 2 <= vertical bar X vertical bar < vertical bar V(G)vertical bar and no vertex in V(G) - X has both a neighbor and a non-neighbor in X. A graph is prime if it has no homogeneous set. We present an algorithm to decide whether a class of graphs given by a finite set of forbidden induced subgraphs contains infinitely many non-isomorphic prime graphs. (C) 2018 Elsevier B.V. All rights reserved. | - |
| dc.language | English | - |
| dc.publisher | ELSEVIER SCIENCE BV | - |
| dc.title | Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000462104600007 | - |
| dc.identifier.scopusid | 2-s2.0-85056661807 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 257 | - |
| dc.citation.beginningpage | 60 | - |
| dc.citation.endingpage | 66 | - |
| dc.citation.publicationname | DISCRETE APPLIED MATHEMATICS | - |
| dc.identifier.doi | 10.1016/j.dam.2018.10.030 | - |
| dc.contributor.localauthor | Oum, Sang-il | - |
| dc.contributor.nonIdAuthor | Brignall, Robert | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | Modular decomposition | - |
| dc.subject.keywordAuthor | Induced subgraph | - |
| dc.subject.keywordAuthor | Prime graph | - |
| dc.subject.keywordAuthor | Homogeneous set | - |
| dc.subject.keywordPlus | SIMPLE PERMUTATIONS | - |
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.