Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
Authors:
- Robert BrignallRBRobert Brignall
- Hojin ChoiHCHojin Choi
- Jisu JeongJJJisu Jeong
- Sang-Il OumSOSang-Il Oum
- 1 March 2019
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 257, 60-66
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Research Foundation of KoreaNational Research Foundation of Korea (NRF) (NRF-2017R1A2B4005020)
This publication has 16 references indexed in Scilit:
- Two forbidden induced subgraphs and well-quasi-orderingDiscrete Mathematics, 2011
- Decomposing simple permutations, with enumerative consequencesCombinatorica, 2008
- Simple permutations: Decidability and unavoidable substructuresTheoretical Computer Science, 2008
- All minimal prime extensions of hereditary classes of graphsTheoretical Computer Science, 2007
- On the closure of graphs under substitutionDiscrete Mathematics, 1997
- Indecomposable graphsDiscrete Mathematics, 1997
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structuresDiscrete Mathematics, 1993
- P4-trees and substitution decompositionDiscrete Applied Mathematics, 1992
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967