"4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$."

Sean Kim, Michael E. Picollelli (2024)

> Home

Details and statistics

DOI: 10.37236/12623

access: closed

type: Journal Article

metadata version: 2024-08-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorics/KimP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/KimP24
Sean Kim, Michael E. Picollelli:
4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$. Electron. J. Comb. 31(2) (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.