Name
Abstract | ||
|---|---|---|
We consider those graphs G that admit decompositions into copies of a fixed graph F, each copy being an induced subgraph of G. We are interested in finding the extremal graphs with this property, that is, those graphs G on n vertices with the maximum possible number of edges. We discuss the cases where F is a complete equipartite graph, a cycle, a star, or a graph on at most four vertices. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1002/jgt.21654 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
decomposition,induced subgraph,extremal graph theory | Discrete mathematics,Topology,Combinatorics,Chordal graph,Induced subgraph,Cograph,Pathwidth,Universal graph,1-planar graph,Pancyclic graph,Mathematics,Split graph | Journal |
Volume | Issue | ISSN |
72.0 | 4.0 | 0364-9024 |
Citations | PageRank | References |
1 | 0.38 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Adrian Bondy | 1 | 15 | 1.61 |
| Jayme Luiz Szwarcfiter | 2 | 618 | 95.79 |