Alternating cycle-free matchings
type: Item
instance of: scholarly article
title: Alternating cycle-free matchings
zbMATH Open document ID: 0805.68091
DOI: 10.1007/BF00383169
author: Haiko Müller
published in: Order
publication date: 1994-05-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 567802
zbMATH Keywords: NP-completeness
zbMATH Keywords: P-solvability
zbMATH Keywords: comparability graph
zbMATH Keywords: alternating cycle- free matchings
zbMATH Keywords: Jump-number
zbMATH Keywords: partially ordered sets
zbMATH Keywords: chordal bipartite graph
zbMATH Keywords: distance hereditary graphs
MaRDI profile type: Publication
cites work: Chordality properties on graphs and minimal conceptual connections in semantic data models
cites work: Distance-hereditary graphs
cites work: Q3974856
cites work: Q3890731
cites work: The Jump Number of Dags and Posets: An Introduction
cites work: Minimizing Setups for Cycle-Free Ordered Sets
cites work: Characterizations of strongly chordal graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q4198056
cites work: Q5184948
cites work: Optimizing weakly triangulated graphs
cites work: Q3698661
cites work: Optimal Linear Extensions by Interchanging Chains
cites work: Perfect matchings in hexagonal systems
cites work: A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
cites work: Q3676161
cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
description: scientific article; zbMATH DE number 567802