Greedily constructing maximal partial \(f\)-factors

DOI10.1016/j.disc.2008.04.047zbMath1214.05133OpenAlexW1977854755MaRDI QIDQ1025473

David Tankus, Michael Tarsi

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.047

zbMATH Keywords

factorsgreedyhereditary systemequimatchable

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Graphs with maximal induced matchings of the same size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
• The structure of well-covered graphs and the complexity of their recognition problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Well-covered claw-free graphs
• On randomly Hamiltonian graphs
• Complexity results for well‐covered graphs
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
• Randomly matchable graphs
• WELL-COVERED GRAPHS: A SURVEY
• A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
• Recognizing Greedy Structures
• Randomly Traceable Graphs
• Randomly hamiltonian digraphs

This page was built for publication: Greedily constructing maximal partial \(f\)-factors