Bicolored matchings in some classes of graphs

DOI10.1007/S00373-006-0686-8MaRDI QIDQ5899324zbMATH OpenOpenAlexFDO

Authors Marie-Christine Costa, Dominique De Werra, Christophe Picouleau, Bernard Ries

Publication date 26 April 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL http://doc.rero.ch/record/326910/files/bicoloredmatchingscopy.pdf

zbMATH Keywords

alternating cyclesBicolored graphsbipartite graphsCactiLine-perfect graphstrees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The rainbow number of matchings in regular bipartite graphs
• Coloured matchings in bipartite graphs
• Rainbow matchings in an edge-colored planar bipartite graph
• Matchings in colored bipartite networks
• scientific article; zbMATH DE number 5914945

Cites work

• Efficient algorithms for a family of matroid intersection problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• Line perfect graphs
• Matchings in colored bipartite networks
• Maximum matching of given weight in complete and complete bipartite graphs
• Network flows. Theory, algorithms, and applications.
• On line perfect graphs
• Some NP-complete problems in linear programming
• The NP-Completeness of Edge-Coloring

Cited in

(20)

• Blockers and transversals
• The labeled perfect matching in bipartite graphs
• Coloured matchings in bipartite graphs
• Matchings in colored bipartite networks
• Minimum \(k\)-critical bipartite graphs
• Matchings with few colors in colored complete graphs and hypergraphs
• On trees with a maximum proper partial 0-1 coloring containing a maximum matching
• Random bichromatic matchings
• On the basis graph of a bicolored matroid
• Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\)
• Solving matching problems efficiently in bipartite graphs
• scientific article; zbMATH DE number 5914945 (Why is no real title available?)
• Random Bichromatic Matchings
• A note on the hardness results for the labeled perfect matching problems in bipartite graphs
• Exact perfect matching in complete graphs
• Subset matching and edge coloring in bipartite graphs
• On color frames of claws and matchings
• Matching, edge-colouring, and dimers.
• Minimum <scp>color‐degree</scp> perfect b‐matchings
• Addendum to ``Bicolored matchings in some classes of graphs

This page was built for publication: Bicolored matchings in some classes of graphs

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