"Almost partitioning 2?colored complete 3?uniform hypergraphs into two ..."

Sebastián Bustamante, Hiêp Hàn, Maya Stein (2019)

> Home

Details and statistics

DOI: 10.1002/JGT.22417

access: closed

type: Journal Article

metadata version: 2022-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/BustamanteHS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/BustamanteHS19
Sebastián Bustamante, Hiêp Hàn, Maya Stein:
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles. J. Graph Theory 91(1): 5-15 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.