Bicolored matchings in some classes of graphs
From MaRDI portal
Publication:5899324
DOI10.1007/s00373-006-0686-8zbMath1116.05062OpenAlexW2114731020MaRDI QIDQ5899324
Bernard Ries, Dominique de Werra, Marie-Christine Costa, Christophe Picouleau
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Addendum to ``Bicolored matchings in some classes of graphs ⋮ A note on the hardness results for the labeled perfect matching problems in bipartite graphs ⋮ Blockers and transversals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matchings in colored bipartite networks
- Some NP-complete problems in linear programming
- Efficient algorithms for a family of matroid intersection problems
- The NP-Completeness of Edge-Coloring
- Line perfect graphs
- On line perfect graphs
- Maximum matching of given weight in complete and complete bipartite graphs
This page was built for publication: Bicolored matchings in some classes of graphs
