首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the vertex packing problem
Authors:C De Simone
Institution:(1) Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, 00185 Roma, Italy
Abstract:A forbidden subgraphs characterization of the class of graphs that arise from bipartite graphs, odd holes, and graphs with no complement of a diamond via repeated substitutions is given. This characterization allows us to solve the vertex packing problem for the graphs in this class.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号