Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
2016
Online
report
Zugriff:
A homogeneous set of a graph $G$ is a set $X$ of vertices such that $2\le \lvert X\rvert <\lvert V(G)\rvert$ 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.
Comment: 13 pages, 5 figures. Accepted to Discrete Appl. Math
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: | |
Veröffentlichung: | 2016 |
Medientyp: | report |
DOI: | 10.1016/j.dam.2018.10.030 |
Schlagwort: |
|
Sonstiges: |
|