Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs.
In: Discrete Applied Mathematics, Jg. 257 (2019-03-31), S. 60-66
Online
academicJournal
Zugriff:
Abstract A homogeneous set of a graph G is a set X of vertices such that 2 ≤ | X | < | V (G) | 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. [ABSTRACT FROM AUTHOR]
Titel: |
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs.
|
---|---|
Autor/in / Beteiligte Person: | Brignall, Robert ; Choi, Hojin ; Jeong, Jisu ; Oum, Sang-il |
Link: | |
Zeitschrift: | Discrete Applied Mathematics, Jg. 257 (2019-03-31), S. 60-66 |
Veröffentlichung: | 2019 |
Medientyp: | academicJournal |
ISSN: | 0166-218X (print) |
DOI: | 10.1016/j.dam.2018.10.030 |
Schlagwort: |
|
Sonstiges: |
|