Rainbow matching in edge-colored graphs
From MaRDI portal
Publication:976680
Recommendations
Cited in
(27)- Balanced edge-colorings avoiding rainbow cliques of size four
- Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
- Large rainbow matchings in edge-colored graphs with given average color degree
- Rainbow tetrahedra in Cayley graphs
- Existence of rainbow matchings in strongly edge-colored graphs
- Orthogonal matchings revisited
- Rainbow matchings of size (G) in properly edge-colored graphs
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- A note on large rainbow matchings in edge-coloured graphs
- A note on rainbow matchings
- Template-driven rainbow coloring of proper interval graphs
- A note on rainbow matchings in strongly edge-colored graphs
- Rainbow cycles for families of matchings
- Template-driven rainbow coloring of proper interval graphs
- Large rainbow matchings in edge-coloured graphs
- Rainbow matchings: existence and counting
- Existence of rainbow matchings in properly edge-colored graphs
- Large matchings in bipartite graphs have a rainbow matching
- Rainbow matchings of size m in graphs with total color degree at least 2mn
- Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
- Rainbow matchings in strongly edge-colored graphs
- Existences of rainbow matchings and rainbow matching covers
- Quadratic vertex kernel for rainbow matching
- Topological methods for the existence of a rainbow matching
- Rainbow edge-coloring and rainbow domination
- Total coloring conjecture for certain classes of graphs
- Some rainbow cycles in \(r\)-good edge-colorings
This page was built for publication: Rainbow matching in edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976680)