Non-minimal degree-sequence-forcing triples
type: Item
instance of: scholarly article
title: Non-minimal degree-sequence-forcing triples
zbMATH Open document ID: 1327.05284
author: Michael D. Barrus
author: Stephen G. Hartke
author: M. Kumbhat
published in: Graphs and Combinatorics
publication date: 2015-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6484801
zbMATH Keywords: degree-sequence-forcing set
zbMATH Keywords: forbidden subgraphs
zbMATH Keywords: degree sequence characterization
zbMATH Keywords: 2-switch
zbMATH Keywords: potentially \(P\)-graphic
zbMATH Keywords: forcibly \(P\)-graphic
MaRDI profile type: Publication
full work available at URL: s00373-014-1450-0
OpenAlex ID: W2061159553
cites work: Graph classes characterized both by forbidden subgraphs and degree sequences
cites work: Minimal forbidden sets for degree sequence characterizations
cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
cites work: The strong perfect graph theorem
cites work: Q4165164
cites work: Characterizing forbidden clawless triples implying Hamiltonian graphs
cites work: Forbidden triples implying Hamiltonicity: for all graphs
cites work: Q4200113
cites work: Some Properties of Graphs with Multiple Edges
cites work: Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
cites work: 3-colorability and forbidden subgraphs. I: Characterizing pairs
cites work: The splittance of a graph
cites work: A Note on Unigraphic Sequences
cites work: Linear recognition of pseudo-split graphs
cites work: Q4869540
DOI: 10.1007/S00373-014-1450-0
description: scientific article; zbMATH DE number 6484801