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

来源：

JOURNAL OF GRAPH THEORY | 2008年 / 57卷 / 02期

关键词：

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 条

[31] Planar graph coloring with forbidden subgraphs:: Why trees and paths are dangerous
Broersma, H
Fomin, FV
Kratochvíl, J
Woeginger, GJ
ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 160 - 169
[32] COVERING VERTEX SET OF A GRAPH WITH SUBGRAPHS OF SMALLER DEGREE
LAWRENCE, J
DISCRETE MATHEMATICS, 1978, 21 (01) : 61 - 68
[33] Deterministic counting of graph colourings using sequences of subgraphs
Efthymiou, Charilaos
COMBINATORICS PROBABILITY & COMPUTING, 2020, 29 (04): : 555 - 586
[34] A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
Malyshev, D. S.
DISCRETE APPLIED MATHEMATICS, 2016, 203 : 117 - 126
[35] Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes
Ginn, M
JOURNAL OF GRAPH THEORY, 1999, 30 (02) : 71 - 76
[36] Paired versus double domination in forbidden graph classes
Henning, Michael A.
Maniya, Paras
Pradhan, Dinabandhu
COMPUTATIONAL & APPLIED MATHEMATICS, 2025, 44 (01):
[37] Paired versus double domination in forbidden graph classes
Henning, Michael A.
Maniya, Paras
Pradhan, Dinabandhu
Computational and Applied Mathematics, 1
[38] Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
Alcon, L.
Gutierrez, M.
Mazzoleni, M. P.
DISCRETE MATHEMATICS, 2015, 338 (01) : 103 - 110
[39] Large induced subgraphs of random graphs with given degree sequences
Southwell, Angus
Wormald, Nick
RANDOM STRUCTURES & ALGORITHMS, 2024,
[40] The maximum number of complete subgraphs in a graph with given maximum degree
Cutler, Jonathan
Radcliffe, A. J.
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2014, 104 : 60 - 71

← 1 2 3 4 5 →