"Chromatic classes of 2-connected (n, n+4)-graphs with at least four triangles."

Y. H. Peng, Gee-Choon Lau (2004)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2003.05.003

access: open

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/PengL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/PengL04
Y. H. Peng, Gee-Choon Lau:
Chromatic classes of 2-connected (n, n+4)-graphs with at least four triangles. Discret. Math. 278(1-3): 209-218 (2004)

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.