Matching and multidimensional matching in chordal and strongly chordal graphs
type: Item
instance of: scholarly article
title: Matching and multidimensional matching in chordal and strongly chordal graphs
zbMATH Open document ID: 0902.68146
DOI: 10.1016/S0166-218X(98)00006-7
author: Elias Dahlhaus
author: Marek Karpinski
published in: Discrete Applied Mathematics
publication date: 1998-07-28T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1180355
zbMATH Keywords: chordal graphs
MaRDI profile type: Publication
cites work: A polynomial algorithm for b-matchings: An alternative approach
cites work: On the Desirability of Acyclic Database Schemes
cites work: A characterisation of rigid circuit graphs
cites work: Characterizations of strongly chordal graphs
cites work: Incidence matrices and interval graphs
cites work: Q4198056
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q3731028
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Finding a maximum matching in a circular-arc graph
cites work: Matching is as easy as matrix inversion
cites work: Q4234156
cites work: Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
description: scientific article; zbMATH DE number 1180355