"Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into ..."

Peter Allen et al. (2024)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2023.103838

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejc/AllenBLSS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/AllenBLSS24
Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein:
Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. Eur. J. Comb. 121: 103838 (2024)

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.