"Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound ..."

Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald (2024)

> Home

Details and statistics

DOI: 10.1007/978-3-031-75409-8_6

access: closed

type: Conference or Workshop Paper

metadata version: 2025-02-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/BessyGR24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/BessyGR24
Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald:
Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. WG 2024: 79-91

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.