Rounding in symmetric matrices and undirected graphs
type: Item
instance of: scholarly article
title: Rounding in symmetric matrices and undirected graphs
zbMATH Open document ID: 0920.05062
DOI: 10.1016/0166-218X(96)81476-4
author: Brenda Li
author: Pavol Hell
author: David Kirkpatrick
published in: Discrete Applied Mathematics
publication date: 1996-10-09T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 933106
zbMATH Keywords: rounding
zbMATH Keywords: symmetric matrices
zbMATH Keywords: graph factors
MaRDI profile type: Publication
cites work: An algorithmic proof of Tutte's f-factor theorem
cites work: Simplified existence theorems for \((g,f)\)-factors
cites work: Dividing a graph by degrees
cites work: Q4063504
cites work: Controlled Rounding
cites work: A theorem on flows in networks
cites work: Q4198056
cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
cites work: A remark on the existence of finite graphs
cites work: Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
cites work: Packings by Complete Bipartite Graphs
cites work: The NP-Completeness of Some Edge-Partition Problems
cites work: Degree-Constrained Network Spanners with Nonconstant Delay
cites work: Q3880849
cites work: Matching theory
cites work: Matrices of zeros and ones
Wikidata QID: Q127344036
description: scientific article; zbMATH DE number 933106