On the edge spectrum of saturated graphs for paths and stars
For a given graph H, we say that a graph G on n vertices is H‐saturated if H is not a subgraph of G, but for any edge e E E(G) the graph G +e contains a subgraph isomorphic to H. The set of all values m for which there exists an H‐saturated graph on n vertices and m edges is called the edge spectrum...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
Wiley
2018
|