๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On maximum planar induced subgraphs
โœ Luerbio Faria; Celina M. Herrera de Figueiredo; Sylvain Gravier; Candido F.X. de ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB
Fast partitioning l-apex graphs with app
โœ Dimitrios M. Thilikos; Hans L. Bodlaender ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 542 KB

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

On the forbidden induced subgraph sandwi
โœ Simone Dantas; Celina M.H. de Figueiredo; Murilo V.G. da Silva; Rafael B. Teixei ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 495 KB
A result on Hamiltonian line graphs invo
โœ H. J. Veldman ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 384 KB

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