Littérature scientifique sur le sujet « Edge-colored graph »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Edge-colored graph ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Edge-colored graph"
Ma, Huawen. « Maximum Colored Cuts in Edge-Colored Complete Graphs ». Journal of Mathematics 2022 (7 juillet 2022) : 1–4. http://dx.doi.org/10.1155/2022/9515498.
Texte intégralArora, Ajay, Eddie Cheng et Colton Magnant. « Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles ». Parallel Processing Letters 29, no 04 (décembre 2019) : 1950016. http://dx.doi.org/10.1142/s0129626419500166.
Texte intégralGuo, Zhiwei, Hajo Broersma, Ruonan Li et Shenggui Zhang. « Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ». Journal of Combinatorial Optimization 40, no 4 (4 septembre 2020) : 1008–19. http://dx.doi.org/10.1007/s10878-020-00644-7.
Texte intégralJin, Zemin, Kun Ye, He Chen et Yuefang Sun. « Large rainbow matchings in semi-strong edge-colorings of graphs ». Discrete Mathematics, Algorithms and Applications 10, no 02 (avril 2018) : 1850021. http://dx.doi.org/10.1142/s1793830918500210.
Texte intégralRazumovsky, P. V., et M. B. Abrosimov. « THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS ». Bulletin of the South Ural State University series "Mathematics. Mechanics. Physics" 13, no 4 (2021) : 77–89. http://dx.doi.org/10.14529/mmph210409.
Texte intégralDI GIACOMO, EMILIO, GIUSEPPE LIOTTA et FRANCESCO TROTTA. « ON EMBEDDING A GRAPH ON TWO SETS OF POINTS ». International Journal of Foundations of Computer Science 17, no 05 (octobre 2006) : 1071–94. http://dx.doi.org/10.1142/s0129054106004273.
Texte intégralMao, Yaping, Zhao Wang, Fengnan Yanling et Chengfu Ye. « Monochromatic connectivity and graph products ». Discrete Mathematics, Algorithms and Applications 08, no 01 (26 février 2016) : 1650011. http://dx.doi.org/10.1142/s1793830916500117.
Texte intégralMa, Hongping, Zhengke Miao, Hong Zhu, Jianhua Zhang et Rong Luo. « Strong List Edge Coloring of Subcubic Graphs ». Mathematical Problems in Engineering 2013 (2013) : 1–6. http://dx.doi.org/10.1155/2013/316501.
Texte intégralHou, Rui, Ji-Gang Wu, Yawen Chen, Haibo Zhang et Xiu-Feng Sui. « Constructing Edge-Colored Graph for Heterogeneous Networks ». Journal of Computer Science and Technology 30, no 5 (septembre 2015) : 1154–60. http://dx.doi.org/10.1007/s11390-015-1551-0.
Texte intégralSimonyi, Gábor. « On Colorful Edge Triples in Edge-Colored Complete Graphs ». Graphs and Combinatorics 36, no 6 (9 septembre 2020) : 1623–37. http://dx.doi.org/10.1007/s00373-020-02214-4.
Texte intégralThèses sur le sujet "Edge-colored graph"
Brownlee, Erin Ann. « Maximally Edge-Colored Directed Graph Algebras ». Thesis, North Dakota State University, 2017. https://hdl.handle.net/10365/28666.
Texte intégralWang, Bin. « Rainbow structures in properly edge-colored graphs and hypergraph systems ». Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG016.
Texte intégralExtremal Combinatorics is one of the most vigorous branch of Combinatorial Mathematics in recent decades and it has been widely used in Computer Science, Network Design and Coding Design. It focuses on determining the maximum or minimum possible size of certain combinatorial structures, subject to certain conditions or constraints. The host sets could be graphs, digraphs, random graphs, hypergraphs, integers, primes, sets, edge-colored graphs and so on. The local structures could be matchings, cliques, cycles, trees, spanning subgraphs (F-factors, Hamilton cycles), intersecting families, arithmetic progressions, solutions for some equations (e.g. x₊y₌z), rainbow subgraphs and so on. In particular, Extremal Graph Theory is a significant branch of Extremal Combinatorics, which primarily explores how the overall properties of a graph influence its local structures. We study the existence of a rainbow Hamilton cycle in k-graph systems, the existence of rainbow perfect matching in k-graph systems, and the existence of long rainbow cycle in properly edge-colored graphs
Hu, Jie. « Rainbow subgraphs and properly colored subgraphs in colored graphs ». Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG045.
Texte intégralIn 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
Montero, Leandro Pedro. « Graphes et couleurs : graphes arêtes-coloriés, coloration d'arêtes et connexité propre ». Phd thesis, Université Paris Sud - Paris XI, 2012. http://tel.archives-ouvertes.fr/tel-00776899.
Texte intégralBorozan, Valentin. « Proper and weak-proper trees in edges-colored graphs and multigraphs ». Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00738959.
Texte intégralBabu, Jasine. « Algorithmic and Combinatorial Questions on Some Geometric Problems on Graphs ». Thesis, 2014. http://etd.iisc.ac.in/handle/2005/3485.
Texte intégralBabu, Jasine. « Algorithmic and Combinatorial Questions on Some Geometric Problems on Graphs ». Thesis, 2014. http://etd.iisc.ernet.in/2005/3485.
Texte intégralLo, Yuan-Hsun, et 羅元勳. « Multicolored Subgraphs in an Edge-colored Graphs ». Thesis, 2010. http://ndltd.ncl.edu.tw/handle/34428885124296037709.
Texte intégral國立交通大學
應用數學系所
98
A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this dissertation, we first prove that a complete graph of order 2m (m≠2) can be properly edge-colored with 2m−1 colors in such a way that the edges of K_{2m} can be partitioned into m isomorphic multicolored spanning trees. Then, for the complete graph on 2m+1 vertices, we give a proper edge-coloring with 2m+1 colors such that the edges of K{2m+1} can be partitioned into m multicolored Hamiltonian cycles. In the second part, we first prove that if K_{2m} admits a proper (2m−1)-edge-coloring such that any two colors induce a 2-factor with each component a 4-cycle, then K2m can be partitioned into m isomorphic multicolored spanning trees. As a consequence, we show the existence of three isomorphic multicolored spanning trees whenever m≥14. As to the complete graph of odd order, two multicolored isomorphic unicyclic spanning subgraphs can be found in an arbitrary proper (2m+1)-edge-coloring of K{2m+1}. If we drop the condition “isomorphic”, we prove that there exist Ω(√m) mutually edge-disjoint multicolored spanning trees in any proper (2m−1)-edge-colored K_{2m} by applying a recursive construction. Using an analogous strategy, we can also find Ω(√m) mutually edge-disjoint multicolored unicyclic spanning subgraphs in any proper (2m−1)-edge-colored K_{2m−1}. Finally, we consider the problem of how to forbid a specific multicolored subgraph in a properly edge-colored complete bipartite graph. We (1) prove that for any integer k≥2, if n≥5k−6, then any properly n-edge-colored K_{k,n} contains a multicolored C2k, and (2) determine the order of the properly edge-colored complete bipartite graphs which forbid multicolored 6-cycles.
Chapitres de livres sur le sujet "Edge-colored graph"
Di Giacomo, Emilio, Giuseppe Liotta et Francesco Trotta. « Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge ». Dans Graph Drawing, 315–26. Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-77537-9_31.
Texte intégralDas, Anita, P. Suresh et S. V. Subrahmanya. « Rainbow path and minimum degree in properly edge colored graphs ». Dans The Seventh European Conference on Combinatorics, Graph Theory and Applications, 319–25. Pisa : Scuola Normale Superiore, 2013. http://dx.doi.org/10.1007/978-88-7642-475-5_51.
Texte intégralChinone, Kosuke, et Atsuyoshi Nakamura. « An Explainable Recommendation Based on Acyclic Paths in an Edge-Colored Graph ». Dans Lecture Notes in Computer Science, 40–52. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-97546-3_4.
Texte intégralLarsen, Casper Abild, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol et Andreas Pavlogiannis. « A Truly Symbolic Linear-Time Algorithm for SCC Decomposition ». Dans Tools and Algorithms for the Construction and Analysis of Systems, 353–71. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_22.
Texte intégralLionni, Luca. « Colored Simplices and Edge-Colored Graphs ». Dans Colored Discrete Spaces, 17–74. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96023-4_2.
Texte intégralAngel, Eric, Evripidis Bampis, Alexander Kononov, Dimitris Paparas, Emmanouil Pountourakis et Vassilis Zissimopoulos. « Clustering on k-Edge-Colored Graphs ». Dans Mathematical Foundations of Computer Science 2013, 50–61. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40313-2_7.
Texte intégralMorawietz, Nils, Niels Grüttemeier, Christian Komusiewicz et Frank Sommer. « Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs ». Dans SOFSEM 2020 : Theory and Practice of Computer Science, 248–59. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38919-2_21.
Texte intégralAbouelaoualim, A., K. Ch Das, L. Faria, Y. Manoussakis, C. Martinhon et R. Saad. « Paths and Trails in Edge-Colored Graphs ». Dans Lecture Notes in Computer Science, 723–35. Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78773-0_62.
Texte intégralSoifer, Alexander. « Edge Colored Graphs : Ramsey and Folkman Numbers ». Dans The Mathematical Coloring Book, 242–60. New York, NY : Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-74642-5_27.
Texte intégralSoifer, Alexander. « Edge-Colored Graphs : Ramsey and Folkman Numbers ». Dans The New Mathematical Coloring Book, 289–311. New York, NY : Springer US, 2024. http://dx.doi.org/10.1007/978-1-0716-3597-1_29.
Texte intégralActes de conférences sur le sujet "Edge-colored graph"
Herber, Daniel R., Tinghao Guo et James T. Allison. « Enumeration of Architectures With Perfect Matchings ». Dans ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-60212.
Texte intégralVardi, Moshe Y., et Zhiwei Zhang. « Solving Quantum-Inspired Perfect Matching Problems via Tutte-Theorem-Based Hybrid Boolean Constraints ». Dans Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California : International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/227.
Texte intégralGarvardt, Jaroslav, Niels Grüttemeier, Christian Komusiewicz et Nils Morawietz. « Parameterized Local Search for Max c-Cut ». Dans Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California : International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/620.
Texte intégralFaria, Luerbio, Sulamita Klein, Ignasi Sau, Uéverton S. Souza et Rubens Sucupira. « On Colored Edge Cuts in Graphs ». Dans I Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2016.9764.
Texte intégralBotler, Fábio, Lucas Colucci, Paulo Matias, Guilherme Mota, Roberto Parente et Matheus Secco. « Proper edge colorings of complete graphs without repeated triangles ». Dans Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.222917.
Texte intégral