On-line maximum-order induced hereditary subgraph problems
โ Scribed by Marc Demange; Xavier Paradon; Vangelis Th. Paschos
- Book ID
- 111205786
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 179 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0969-6016
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A graph is Z-apex if it can be made planar by removing at most 1 vertices. In this paper we show that the vertex set of any graph not containing an l-apex graph as a minor can be partitioned in linear time into 2' sets inducing graphs with small treewidth. As a consequence, several maximum induced-s
It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by imposing certain restrictions on certain induced subgraphs of G. Thereby a number of known results on hamiltonian line graphs are improved, including the earliest results in terms of vertex degrees. O