Greedily constructing maximal partial \(f\)-factors
type: Item
instance of: scholarly article
title: Greedily constructing maximal partial \(f\)-factors
zbMATH Open document ID: 1214.05133
author: David Tankus
author: Michael Tarsi
published in: Discrete Mathematics
publication date: 2009-06-19T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5566684
zbMATH Keywords: greedy
zbMATH Keywords: factors
zbMATH Keywords: hereditary system
zbMATH Keywords: equimatchable
MaRDI profile type: Publication
full work available at URL: j.disc.2008.04.047
OpenAlex ID: W1977854755
cites work: Recognizing Greedy Structures
cites work: A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
cites work: Randomly Traceable Graphs
cites work: Randomly hamiltonian digraphs
cites work: Q3139761
cites work: Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
cites work: Q3340896
cites work: WELL-COVERED GRAPHS: A SURVEY
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q4739657
cites work: Complexity results for well‐covered graphs
cites work: Randomly matchable graphs
cites work: Well-covered claw-free graphs
cites work: The structure of well-covered graphs and the complexity of their recognition problems
cites work: Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
cites work: On randomly Hamiltonian graphs
DOI: 10.1016/J.DISC.2008.04.047
description: scientific article; zbMATH DE number 5566684