Name
Abstract | ||
|---|---|---|
Let G be a graph on n vertices, i ( G ) the number of pairwise non-isomorphic induced subgraphs of G and k ⩾1. We prove that if i ( G )= o ( n k +1 ) then by omitting o ( n ) vertices the graph can be made ( l , m )-almost canonical with l + m ⩽ k +1. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1016/0012-365X(89)90085-X | Discrete Mathematics |
Keywords | Field | DocType |
distinct induced subgraphs | Discrete mathematics,Wheel graph,Combinatorics,Graph toughness,Graph power,Bound graph,Cycle graph,Factor-critical graph,Distance-regular graph,Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
75 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
10 | 1.75 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| andras hajnal | 2 | 39 | 4.90 |