Rainbow edge-coloring and rainbow domination
DOI10.1016/J.DISC.2012.03.014zbMATH Open1277.05064OpenAlexW1974728426MaRDI QIDQ383777FDOQ383777
Authors: Timothy D. Lesaulnier, Douglas B. West 
Publication date: 6 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.014
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Heterochromatic matchings in edge-colored graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- On the ratio of optimal integral and fractional covers
- Transversal numbers of uniform hypergraphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Large rainbow matchings in edge-coloured graphs
- Domination-balanced graphs
- Title not available (Why is that?)
- Rainbow matching in edge-colored graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On graphs having domination number half their order
- High degree graphs contain large-star factors
Cited In (4)
This page was built for publication: Rainbow edge-coloring and rainbow domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383777)
