Gotowa bibliografia na temat „Partitioning into vertex-disjoint cycles”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Partitioning into vertex-disjoint cycles”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Partitioning into vertex-disjoint cycles"
ŁUCZAK, TOMASZ, VOJTĚCH RÖDL i ENDRE SZEMERÉDI. "Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles". Combinatorics, Probability and Computing 7, nr 4 (grudzień 1998): 423–36. http://dx.doi.org/10.1017/s0963548398003599.
Pełny tekst źródłaLin, Mugang, Jianxin Wang, Qilong Feng i Bin Fu. "Randomized Parameterized Algorithms for the Kidney Exchange Problem". Algorithms 12, nr 2 (25.02.2019): 50. http://dx.doi.org/10.3390/a12020050.
Pełny tekst źródłaKorostil, Alexander V., i Andrei V. Nikolaev. "Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph". Modeling and Analysis of Information Systems 28, nr 1 (24.03.2021): 6–21. http://dx.doi.org/10.18255/1818-1015-2021-1-6-21.
Pełny tekst źródłaRAJASINGH, INDRA, M. AROCKIARAJ, BHARATI RAJAN i PAUL MANUEL. "CIRCULAR WIRELENGTH OF GENERALIZED PETERSEN GRAPHS". Journal of Interconnection Networks 12, nr 04 (grudzień 2011): 319–35. http://dx.doi.org/10.1142/s0219265911003027.
Pełny tekst źródłaNöllenburg, Martin, Roman Prutkin i Ignaz Rutter. "Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions". International Journal of Computational Geometry & Applications 27, nr 01n02 (marzec 2017): 121–58. http://dx.doi.org/10.1142/s0218195917600068.
Pełny tekst źródłaBODLAENDER, HANS L. "ON DISJOINT CYCLES". International Journal of Foundations of Computer Science 05, nr 01 (marzec 1994): 59–68. http://dx.doi.org/10.1142/s0129054194000049.
Pełny tekst źródłaLi, Jianping, i George Steiner. "Partitioning a graph into vertex-disjoint paths". Studia Scientiarum Mathematicarum Hungarica 42, nr 3 (1.09.2005): 277–94. http://dx.doi.org/10.1556/sscmath.42.2005.3.3.
Pełny tekst źródłaVERSTRAËTE, JACQUES. "A Note on Vertex-Disjoint Cycles". Combinatorics, Probability and Computing 11, nr 1 (styczeń 2002): 97–102. http://dx.doi.org/10.1017/s0963548301004904.
Pełny tekst źródłaEgawa, Yoshimi, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp i Hong Wang. "Vertex-Disjoint Cycles Containing Specified Edges". Graphs and Combinatorics 16, nr 1 (1.03.2000): 81–92. http://dx.doi.org/10.1007/s003730050005.
Pełny tekst źródłaLi, Ruijuan, Juanjuan Liang, Xinhong Zhang i Yubao Guo. "Vertex-disjoint cycles in local tournaments". Discrete Mathematics 343, nr 12 (grudzień 2020): 112127. http://dx.doi.org/10.1016/j.disc.2020.112127.
Pełny tekst źródłaRozprawy doktorskie na temat "Partitioning into vertex-disjoint cycles"
Kobeissi, Mohamed. "Plongement de graphes dans l'hypercube". Phd thesis, Grenoble 1, 2001. https://theses.hal.science/tel-00004683.
Pełny tekst źródłaBai, Yandong. "Arc colorings and cycles in digraphs". Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112356/document.
Pełny tekst źródłaIn 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
Części książek na temat "Partitioning into vertex-disjoint cycles"
Kloks, Ton, C. M. Lee i Jiping Liu. "New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs". W 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.
Pełny tekst źródłaStreszczenia konferencji na temat "Partitioning into vertex-disjoint cycles"
Xiao, Mingyu, i Xuanbei Wang. "Exact Algorithms and Complexity of Kidney Exchange". W 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.
Pełny tekst źródłaCeylan, Esra, Jiehua Chen i Sanjukta Roy. "Optimal Seat Arrangement: What Are the Hard and Easy Cases?" W 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.
Pełny tekst źródłaMaiti, Arnab, i Palash Dey. "Parameterized Algorithms for Kidney Exchange". W 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.
Pełny tekst źródła