Minimum <scp>color‐degree</scp> perfect b‐matchings

DOI10.1002/NET.21974OpenAlexW3088167107MaRDI QIDQ6087129

Martin Comis, Unnamed Author, Unnamed Author, Christina Büsing

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21974

zbMATH Keywords

complexitydynamic programmingseries-parallel graphedge-colored graph\(b\)-matchingbounded treewidth

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properly colored paths and cycles
• The labeled maximum matching problem
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• The labeled perfect matching in bipartite graphs
• Treewidth. Computations and approximations
• Budgeted colored matching problems
• A linear algorithm for the domination number of a series-parallel graph
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Bi-criteria and approximation algorithms for restricted matchings
• The path partition problem and related problems in bipartite graphs
• Maximum weight edge-constrained matchings
• Complexity results for rainbow matchings
• On minimum reload cost paths, tours, and flows
• Constrained Matching Problems in Bipartite Graphs
• Randomized and Approximation Algorithms for Blue-Red Matching
• The Minimum Reload s-t Path/Trail/Walk Problems
• Graph minors. II. Algorithmic aspects of tree-width
• Some Matching Problems for Bipartite Graphs
• Multi‐budgeted matching problems
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Minimum reload cost graph factors
• Reload cost problems: Minimum diameter spanning tree

This page was built for publication: Minimum <scp>color‐degree</scp> perfect b‐matchings