Non-minimal Degree-Sequence-Forcing Triples

作者：Barrus Michael D; Hartke Stephen G; Kumbhat Mohit^*

来源：Graphs and Combinatorics, 2015, 31(5): 1189-1209.

DOI：10.1007/s00373-014-1450-0

• Degree-sequence-forcing set
• Forbidden subgraphs
• Degree sequence characterization
• 2-switch
• Potentially P-graphic
• Forcibly P-graphic

Given a set of graphs, a graph is -free if does not contain any member of as an induced subgraph. We say that is a degree-sequence-forcing set if, for each graph in the class of -free graphs, every realization of the degree sequence of is also in . A degree-sequence-forcing set is minimal if no proper subset is degree-sequence-forcing. We characterize the non-minimal degree-sequence-forcing sets when has size .

• 出版日期2015-9