On k-11-representable graphs
- Submitting institution
-
University of Strathclyde
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 85112847
- Type
- D - Journal article
- DOI
-
10.4310/JOC.2019.v10.n3.a3
- Title of journal
- Journal of Combinatorics
- Article number
- -
- First page
- 491
- Volume
- 10
- Issue
- 3
- ISSN
- 2156-3527
- Open access status
- Compliant
- Month of publication
- May
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- 10 - Mathematical Sciences
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper results from a collaboration with researchers from three top
universities in Korea and a research leading institution in Russia. It
led to an invited research lecture given to the academic staff at the Department of Mathematical Sciences, Keio University, the number two research university in Japan.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
