Name
Abstract | ||
|---|---|---|
In this paper, we discuss a generalization of the notion of saturation in graphs in order to deal with induced structures. In particular, we define indsat(n,H), which is the fewest number of gray edges in a trigraph so that no realization of that trigraph has an induced copy of H, but changing any white or black edge to gray results in some realization that does have an induced copy of H. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2012.06.015 | Discrete Mathematics |
Keywords | Field | DocType |
Saturation,Induced subgraphs,Boolean formulas,Trigraphs | Graph theory,Graph,Discrete mathematics,Combinatorics,Saturation (chemistry),Vertex (geometry),Trigraph,Mathematics | Journal |
Volume | Issue | ISSN |
312 | 21 | 0012-365X |
Citations | PageRank | References |
1 | 0.39 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryan R. Martin | 1 | 36 | 10.12 |
| Jason J. Smith | 2 | 1 | 0.39 |