Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles

التفاصيل البيبلوغرافية
العنوان: Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
المؤلفون: Maya Stein, Hiệp Hàn, Sebastián Bustamante
المصدر: Journal of Graph Theory. 91:5-15
بيانات النشر: Wiley, 2018.
سنة النشر: 2018
مصطلحات موضوعية: Combinatorics, Hypergraph, Colored, 010201 computation theory & mathematics, 010102 general mathematics, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, Geometry and Topology, Monochromatic color, 0101 mathematics, 01 natural sciences, Mathematics
تدمد: 0364-9024
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::348b7a8bb554c89331bd948505c9d511
https://doi.org/10.1002/jgt.22417
حقوق: CLOSED
رقم الأكسشن: edsair.doi...........348b7a8bb554c89331bd948505c9d511
قاعدة البيانات: OpenAIRE