Добірка наукової літератури з теми "Partitioning into vertex-disjoint cycles"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Partitioning into vertex-disjoint cycles".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Partitioning into vertex-disjoint cycles"
ŁUCZAK, TOMASZ, VOJTĚCH RÖDL, and ENDRE SZEMERÉDI. "Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles." Combinatorics, Probability and Computing 7, no. 4 (December 1998): 423–36. http://dx.doi.org/10.1017/s0963548398003599.
Повний текст джерелаLin, Mugang, Jianxin Wang, Qilong Feng, and Bin Fu. "Randomized Parameterized Algorithms for the Kidney Exchange Problem." Algorithms 12, no. 2 (February 25, 2019): 50. http://dx.doi.org/10.3390/a12020050.
Повний текст джерелаKorostil, Alexander V., and Andrei V. Nikolaev. "Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph." Modeling and Analysis of Information Systems 28, no. 1 (March 24, 2021): 6–21. http://dx.doi.org/10.18255/1818-1015-2021-1-6-21.
Повний текст джерелаRAJASINGH, INDRA, M. AROCKIARAJ, BHARATI RAJAN, and PAUL MANUEL. "CIRCULAR WIRELENGTH OF GENERALIZED PETERSEN GRAPHS." Journal of Interconnection Networks 12, no. 04 (December 2011): 319–35. http://dx.doi.org/10.1142/s0219265911003027.
Повний текст джерелаNöllenburg, Martin, Roman Prutkin, and Ignaz Rutter. "Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions." International Journal of Computational Geometry & Applications 27, no. 01n02 (March 2017): 121–58. http://dx.doi.org/10.1142/s0218195917600068.
Повний текст джерелаBODLAENDER, HANS L. "ON DISJOINT CYCLES." International Journal of Foundations of Computer Science 05, no. 01 (March 1994): 59–68. http://dx.doi.org/10.1142/s0129054194000049.
Повний текст джерелаLi, Jianping, and George Steiner. "Partitioning a graph into vertex-disjoint paths." Studia Scientiarum Mathematicarum Hungarica 42, no. 3 (September 1, 2005): 277–94. http://dx.doi.org/10.1556/sscmath.42.2005.3.3.
Повний текст джерелаVERSTRAËTE, JACQUES. "A Note on Vertex-Disjoint Cycles." Combinatorics, Probability and Computing 11, no. 1 (January 2002): 97–102. http://dx.doi.org/10.1017/s0963548301004904.
Повний текст джерелаEgawa, Yoshimi, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, and Hong Wang. "Vertex-Disjoint Cycles Containing Specified Edges." Graphs and Combinatorics 16, no. 1 (March 1, 2000): 81–92. http://dx.doi.org/10.1007/s003730050005.
Повний текст джерелаLi, Ruijuan, Juanjuan Liang, Xinhong Zhang, and Yubao Guo. "Vertex-disjoint cycles in local tournaments." Discrete Mathematics 343, no. 12 (December 2020): 112127. http://dx.doi.org/10.1016/j.disc.2020.112127.
Повний текст джерелаДисертації з теми "Partitioning into vertex-disjoint cycles"
Kobeissi, Mohamed. "Plongement de graphes dans l'hypercube." Phd thesis, Grenoble 1, 2001. https://theses.hal.science/tel-00004683.
Повний текст джерелаBai, Yandong. "Arc colorings and cycles in digraphs." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112356/document.
Повний текст джерелаIn 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
Частини книг з теми "Partitioning into vertex-disjoint cycles"
Kloks, Ton, C. M. Lee, and Jiping Liu. "New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs." In 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.
Повний текст джерелаТези доповідей конференцій з теми "Partitioning into vertex-disjoint cycles"
Xiao, Mingyu, and Xuanbei Wang. "Exact Algorithms and Complexity of Kidney Exchange." In 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.
Повний текст джерелаCeylan, Esra, Jiehua Chen, and Sanjukta Roy. "Optimal Seat Arrangement: What Are the Hard and Easy Cases?" In 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.
Повний текст джерелаMaiti, Arnab, and Palash Dey. "Parameterized Algorithms for Kidney Exchange." In 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.
Повний текст джерела