Name
Abstract | ||
|---|---|---|
For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorphic to a member of H. Given an integer P>0, a graph G, and a set of graphs F, we say that G admits an (F,P)-partition if the vertex set of G can be partitioned into P subsets X1,…,XP, so that for every i∈{1,…,P}, either |Xi|=1, or the subgraph of G induced by Xi is {F}-free for some F∈F. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.jctb.2014.01.001 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Induced subgraphs,Ramsey theorem,Cograph | Discrete mathematics,Combinatorics,Disjoint sets,Graph factorization,Induced path,Clique-sum,Induced subgraph,Cograph,Pathwidth,Universal graph,Mathematics | Journal |
Volume | ISSN | Citations |
106 | 0095-8956 | 3 |
PageRank | References | Authors |
0.61 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maria Chudnovsky | 1 | 390 | 46.13 |
| Alex Scott | 2 | 251 | 40.93 |
| Paul D. Seymour | 3 | 2786 | 314.49 |