Graph classes characterized both by forbidden subgraphs and degree sequences

被引:9
|
作者
Barrus, Michael D. [1 ]
Kumbhat, Mohit [1 ]
Hartke, Stephen G. [2 ]
机构
[1] Univ Illinois, Dept Math, Urbana, IL 61801 USA
[2] Univ Nebraska, Dept Math, Lincoln, NE 68588 USA
关键词
degree-sequence-forcing set; forbidden subgraphs; degree sequence characterization; 2-switch; potentially P-graphic; forcibly P-graphic;
D O I
10.1002/jgt.20270
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. We give a complete characterization of the degree-sequence-forcing sets F when F has cardinality at most two. (C) 2007 Wiley Periodicals, Inc.
引用
收藏
页码:131 / 148
页数:18
相关论文
共 50 条