Existence of rainbow matchings in strongly edge-colored graphs
From MaRDI portal
(Redirected from Publication:294535)
Recommendations
Cites work
- A bound on the strong chromatic index of a graph
- A lower bound for the length of a partial transversal in a Latin square
- A note on large rainbow matchings in edge-coloured graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Existences of rainbow matchings and rainbow matching covers
- Graph theory
- Heterochromatic matchings in edge-colored graphs
- Large matchings in bipartite graphs have a rainbow matching
- Large rainbow matchings in edge-coloured graphs
- On a generalization of the Ryser-Brualdi-Stein conjecture
- Problems and results in combinatorial analysis and graph theory
- Rainbow matching in edge-colored graphs
- Rainbow matchings and cycle-free partial transversals of Latin squares
- Rainbow matchings in r-partite r-graphs
- Rainbow matchings in properly edge colored graphs
- Rainbow matchings in strongly edge-colored graphs
- Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
Cited in
(6)- Large rainbow matchings in semi-strong edge-colorings of graphs
- A note on rainbow matchings in strongly edge-colored graphs
- Existence of rainbow matchings in properly edge-colored graphs
- Rainbow matchings in strongly edge-colored graphs
- Rainbow Hamiltonian cycles in strongly edge-colored graphs
- Rainbow matchings and cycle-free partial transversals of Latin squares
This page was built for publication: Existence of rainbow matchings in strongly edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294535)