"Using edge cuts to find Euler tours and Euler families in hypergraphs."

Mateja Sajna, Andrew Wagner (2023)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2023.113537

access: closed

type: Journal Article

metadata version: 2023-08-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/SajnaW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/SajnaW23
Mateja Sajna, Andrew Wagner:
Using edge cuts to find Euler tours and Euler families in hypergraphs. Discret. Math. 346(10): 113537 (2023)

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.