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

DOI10.1002/NET.21974MaRDI QIDQ6087129zbMATH OpenOpenAlexFDO

Authors Christina Büsing, Martin Comis

Publication date 11 December 2023

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

\(b\)-matchingbounded treewidthcomplexitydynamic programmingedge-colored graphseries-parallel graph

Mathematics Subject Classification ID

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

Recommendations

• Coloured matchings in bipartite graphs
• Matchings in colored bipartite networks
• Bicolored matchings in some classes of graphs
• The labeled perfect matching in bipartite graphs
• Approximation and Hardness Results for the Maximum Edge q-coloring Problem

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087129)