Literatura académica sobre el tema "Partitioning into vertex-disjoint cycles"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Partitioning into vertex-disjoint cycles".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Partitioning into vertex-disjoint cycles"
ŁUCZAK, TOMASZ, VOJTĚCH RÖDL y ENDRE SZEMERÉDI. "Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles". Combinatorics, Probability and Computing 7, n.º 4 (diciembre de 1998): 423–36. http://dx.doi.org/10.1017/s0963548398003599.
Texto completoLin, Mugang, Jianxin Wang, Qilong Feng y Bin Fu. "Randomized Parameterized Algorithms for the Kidney Exchange Problem". Algorithms 12, n.º 2 (25 de febrero de 2019): 50. http://dx.doi.org/10.3390/a12020050.
Texto completoKorostil, Alexander V. y Andrei V. Nikolaev. "Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph". Modeling and Analysis of Information Systems 28, n.º 1 (24 de marzo de 2021): 6–21. http://dx.doi.org/10.18255/1818-1015-2021-1-6-21.
Texto completoRAJASINGH, INDRA, M. AROCKIARAJ, BHARATI RAJAN y PAUL MANUEL. "CIRCULAR WIRELENGTH OF GENERALIZED PETERSEN GRAPHS". Journal of Interconnection Networks 12, n.º 04 (diciembre de 2011): 319–35. http://dx.doi.org/10.1142/s0219265911003027.
Texto completoNöllenburg, Martin, Roman Prutkin y Ignaz Rutter. "Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions". International Journal of Computational Geometry & Applications 27, n.º 01n02 (marzo de 2017): 121–58. http://dx.doi.org/10.1142/s0218195917600068.
Texto completoBODLAENDER, HANS L. "ON DISJOINT CYCLES". International Journal of Foundations of Computer Science 05, n.º 01 (marzo de 1994): 59–68. http://dx.doi.org/10.1142/s0129054194000049.
Texto completoLi, Jianping y George Steiner. "Partitioning a graph into vertex-disjoint paths". Studia Scientiarum Mathematicarum Hungarica 42, n.º 3 (1 de septiembre de 2005): 277–94. http://dx.doi.org/10.1556/sscmath.42.2005.3.3.
Texto completoVERSTRAËTE, JACQUES. "A Note on Vertex-Disjoint Cycles". Combinatorics, Probability and Computing 11, n.º 1 (enero de 2002): 97–102. http://dx.doi.org/10.1017/s0963548301004904.
Texto completoEgawa, Yoshimi, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp y Hong Wang. "Vertex-Disjoint Cycles Containing Specified Edges". Graphs and Combinatorics 16, n.º 1 (1 de marzo de 2000): 81–92. http://dx.doi.org/10.1007/s003730050005.
Texto completoLi, Ruijuan, Juanjuan Liang, Xinhong Zhang y Yubao Guo. "Vertex-disjoint cycles in local tournaments". Discrete Mathematics 343, n.º 12 (diciembre de 2020): 112127. http://dx.doi.org/10.1016/j.disc.2020.112127.
Texto completoTesis sobre el tema "Partitioning into vertex-disjoint cycles"
Kobeissi, Mohamed. "Plongement de graphes dans l'hypercube". Phd thesis, Grenoble 1, 2001. https://theses.hal.science/tel-00004683.
Texto completoBai, Yandong. "Arc colorings and cycles in digraphs". Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112356/document.
Texto completoIn this thesis, we study arc colorings and cycles in digraphs. The following topics are considered: vertex-distinguishing proper arc colorings in digraphs, short cycles in digraphs with forbidden subgraphs , disjoint cycles in bipartite tournaments, cycle factors in regualr bipartite tournaments and universal arcs in tournaments. The main results are contained in five original articles published or submitted to an international journal. We introduce vertex-distinguishing proper arc colorings of digraphs. A conjecture on the vertex-distinguishing arc-chromatic number is given and some partial results are obtained. We extend a result of Razborov by proving that the Caccetta-Häggkvist conjecture is true for digraphs with certain induced forbidden subgraphs or with certain forbidden subgraphs. We show that every bipartite tournament with minimum outdegree at least qr-1 has r vertex disjoint cycles of any given possible lengths. The special case q=2 of the result verifies the bipartite tournament case of the Bermond-Thomassen conjecture. As a partial support of a conjecture on 2-cycle-factors in bipartite tournaments, we prove that every k-regular bipartite tournament B with k>2 has two complementary cycles of lengths 6 and |V(B)|-6, unless B is isomorphic to a special digraph. Besides, we show that every k-connected regular bipartite tournament has a k-cycle-factor. We also give a sufficient and necessary condition for the existence of a universal arc in a tournament and characterize all the tournaments in which every arc is universal
Capítulos de libros sobre el tema "Partitioning into vertex-disjoint cycles"
Kloks, Ton, C. M. Lee y Jiping Liu. "New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs". En Graph-Theoretic Concepts in Computer Science, 282–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36379-3_25.
Texto completoActas de conferencias sobre el tema "Partitioning into vertex-disjoint cycles"
Xiao, Mingyu y Xuanbei Wang. "Exact Algorithms and Complexity of Kidney Exchange". En Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/77.
Texto completoCeylan, Esra, Jiehua Chen y Sanjukta Roy. "Optimal Seat Arrangement: What Are the Hard and Easy Cases?" En 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/285.
Texto completoMaiti, Arnab y Palash Dey. "Parameterized Algorithms for Kidney Exchange". En Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/58.
Texto completo