Linear-time certifying algorithms for near-graphical sequences
type: Item
instance of: scholarly article
title: Linear-time certifying algorithms for near-graphical sequences
zbMATH Open document ID: 1185.05135
author: Pavol Hell
author: David Kirkpatrick
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5648108
zbMATH Keywords: degree sequence
zbMATH Keywords: graphical sequence
zbMATH Keywords: \(f\)-factor
zbMATH Keywords: (\(g,f)\)-factor
zbMATH Keywords: graph factor
zbMATH Keywords: certifying algorithm
describes a project that uses: LEDA
MaRDI profile type: Publication
full work available at URL: j.disc.2008.05.005
OpenAlex ID: W2095991286
cites work: An algorithmic proof of Tutte's f-factor theorem
cites work: Simplified existence theorems for \((g,f)\)-factors
cites work: Realizing Degree Sequences in Parallel
cites work: Q4268439
cites work: Reguläre Faktoren von Graphen.
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: Q3258698
cites work: Q3941433
cites work: Q3287781
cites work: A theorem on flows in networks
cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
cites work: Parallel concepts in graph theory
cites work: A remark on the existence of finite graphs
cites work: Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
cites work: Subgraphs with prescribed valencies
cites work: Matching theory
cites work: Q4702188
cites work: Matrices of zeros and ones
cites work: Another look at the degree constrained subgraph problem
cites work: The Factorization of Linear Graphs
cites work: The Factors of Graphs
cites work: Graph factors
cites work: Software reliability via run-time result-checking
DOI: 10.1016/J.DISC.2008.05.005
description: scientific article; zbMATH DE number 5648108