Academic literature on the topic 'Rainbow subgraph'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Rainbow subgraph.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Rainbow subgraph"
Axenovich, Maria, Tao Jiang, and Z. Tuza. "Local Anti-Ramsey Numbers of Graphs." Combinatorics, Probability and Computing 12, no. 5-6 (November 2003): 495–511. http://dx.doi.org/10.1017/s0963548303005868.
Full textLestari, Dia, and I. Ketut Budayasa. "BILANGAN KETERHUBUNGAN PELANGI PADA PEWARNAAN-SISI GRAF." MATHunesa: Jurnal Ilmiah Matematika 8, no. 1 (April 23, 2020): 25–34. http://dx.doi.org/10.26740/mathunesa.v8n1.p25-34.
Full textKOSTOCHKA, ALEXANDR, and MATTHEW YANCEY. "Large Rainbow Matchings in Edge-Coloured Graphs." Combinatorics, Probability and Computing 21, no. 1-2 (February 2, 2012): 255–63. http://dx.doi.org/10.1017/s0963548311000605.
Full textHüffner, Falk, Christian Komusiewicz, Rolf Niedermeier, and Martin Rötzschke. "The Parameterized Complexity of the Rainbow Subgraph Problem." Algorithms 8, no. 1 (February 27, 2015): 60–81. http://dx.doi.org/10.3390/a8010060.
Full textMatos Camacho, Stephan, Ingo Schiermeyer, and Zsolt Tuza. "Approximation algorithms for the minimum rainbow subgraph problem." Discrete Mathematics 310, no. 20 (October 2010): 2666–70. http://dx.doi.org/10.1016/j.disc.2010.03.032.
Full textKoch, Maria, Stephan Matos Camacho, and Ingo Schiermeyer. "Algorithmic approaches for the minimum rainbow subgraph problem." Electronic Notes in Discrete Mathematics 38 (December 2011): 765–70. http://dx.doi.org/10.1016/j.endm.2011.10.028.
Full textGyárfás, András, Jenő Lehel, and Richard H. Schelp. "Finding a monochromatic subgraph or a rainbow path." Journal of Graph Theory 54, no. 1 (2006): 1–12. http://dx.doi.org/10.1002/jgt.20179.
Full textLOH, PO-SHEN, and BENNY SUDAKOV. "Constrained Ramsey Numbers." Combinatorics, Probability and Computing 18, no. 1-2 (March 2009): 247–58. http://dx.doi.org/10.1017/s0963548307008875.
Full textSchiermeyer, Ingo. "On the minimum rainbow subgraph number of a graph." Ars Mathematica Contemporanea 6, no. 1 (June 1, 2012): 83–88. http://dx.doi.org/10.26493/1855-3974.246.94d.
Full textKatrenič, Ján, and Ingo Schiermeyer. "Improved approximation bounds for the minimum rainbow subgraph problem." Information Processing Letters 111, no. 3 (January 2011): 110–14. http://dx.doi.org/10.1016/j.ipl.2010.11.005.
Full textDissertations / Theses on the topic "Rainbow subgraph"
Matos, Camacho Stephan. "Introduction to the Minimum Rainbow Subgraph problem." Doctoral thesis, Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2012. http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-85490.
Full textHu, Jie. "Rainbow subgraphs and properly colored subgraphs in colored graphs." Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG045.
Full textIn this thesis, we study rainbow subgraphs and properly colored subgraphs in edge-colored graphs, and compatible subgraphs in gra-phs with incompatibility systems, which can be viewed as a generalization of edge-colored graphs. Compared with general graphs, edge-colored gra-phs contain more information and are able to model more complicated relations in communication net-work, social science, molecular biology and so on. Hence, the study of structures in edge-colored graphs is significant to both graph theory and other related subjects. We first study the minimum color degree condition forcing vertex-disjoint rainbow triangles in edge-colored graphs. In 2013, Li proved a best possible minimum color degree condition for the existence of a rainbow triangle. Motivated by this, we obtain a sharp minimum color degree condition guaran-teeing the existence of two vertex-disjoint rainbow triangles and propose a conjecture about the exis-tence of k vertex-disjoint rainbow triangles. Secondly, we consider the relation between the order of maximum properly colored tree in edge-colored graph and the minimum color degree. We obtain that for an edge-colored connected graph G, the order of maximum properly colored tree is at least \min\{|G|, 2\delta^{c}(G)\}, which generalizes a result of Cheng, Kano and Wang. Moreover, the lower bound 2delta^{c}(G) in our result is best possible and we characterize all extremal graphs. Thirdly, we research the minimum color degree condition guaranteeing the existence of properly colored 2-factors in edge-colored graphs. We derive an asymptotic minimum color degree con-dition forcing every properly colored 2-factor with exactly t components, which generalizes a result of Lo. We also determine the best possible mini-mum color degree condition for the existence of a properly colored 2-factor in an edge-colored bipartite graph. Finally, we study compatible factors in graphs with incompatibility systems. The notion of incom-patibility system was firstly introduced by Krivelevich, Lee and Sudakov, which can be viewed as a quantitative measure of robustness of graph properties. Recently, there has been an increasing interest in studying robustness of graph proper-ties, aiming to strengthen classical results in extremal graph theory and probabilistic combina-torics. We study the robust version of Alon--Yuster's result with respect to the incompatibility system
Matos, Camacho Stephan [Verfasser], Ingo [Akademischer Betreuer] Schiermeyer, Ingo [Gutachter] Schiermeyer, and Hubert [Gutachter] Randerath. "Introduction to the Minimum Rainbow Subgraph problem / Stephan Matos Camacho ; Gutachter: Ingo Schiermeyer, Hubert Randerath ; Betreuer: Ingo Schiermeyer." Freiberg : Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2012. http://d-nb.info/1220911321/34.
Full textBook chapters on the topic "Rainbow subgraph"
Hüffner, Falk, Christian Komusiewicz, Rolf Niedermeier, and Martin Rötzschke. "The Parameterized Complexity of the Rainbow Subgraph Problem." In Graph-Theoretic Concepts in Computer Science, 287–98. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12340-0_24.
Full textRodaro, Emanuele, and Pedro V. Silva. "Never Minimal Automata and the Rainbow Bipartite Subgraph Problem." In Developments in Language Theory, 374–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22321-1_32.
Full textTirodkar, Sumedh, and Sundar Vishwanathan. "On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems." In Algorithms and Computation, 106–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48971-0_10.
Full textMagnant, Colton, and Pouria Salehi Nowbandegani. "General Structure Under Forbidden Rainbow Subgraphs." In Topics in Gallai-Ramsey Theory, 9–23. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48897-0_2.
Full textMagnant, Colton, and Pouria Salehi Nowbandegani. "Gallai-Ramsey Results for Other Rainbow Subgraphs." In Topics in Gallai-Ramsey Theory, 81–96. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48897-0_4.
Full text"Rainbow Subgraphs and their Applications." In Surveys in Combinatorics 2022, 191–214. Cambridge University Press, 2022. http://dx.doi.org/10.1017/9781009093927.007.
Full textErdős, Paul, and Zsolt Tuza. "Rainbow Subgraphs in Edge-Colorings of Complete Graphs." In Quo Vadis, Graph Theory? - A Source Book for Challenges and Directions, 81–88. Elsevier, 1993. http://dx.doi.org/10.1016/s0167-5060(08)70377-7.
Full text