Classes of graphs with low complexity: The case of classes with bounded linear rankwidth

Jaroslav Nešetřil, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz

Open source

DOI: 10.1016/j.ejc.2020.103223
Published: 2021-01
Container: European Journal of Combinatorics
Publisher: Elsevier BV
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1016/j.ejc.2020.103223,
  title = {Classes of graphs with low complexity: The case of classes with bounded linear rankwidth},
  author = {Jaroslav Nešetřil and Patrice Ossona de Mendez and Roman Rabinovich and Sebastian Siebertz},
  year = {2021},
  journal = {European Journal of Combinatorics},
  doi = {10.1016/j.ejc.2020.103223},
  url = {https://doi.org/10.1016/j.ejc.2020.103223}
}

RIS

TY  - JOUR
TI  - Classes of graphs with low complexity: The case of classes with bounded linear rankwidth
AU  - Jaroslav Nešetřil
AU  - Patrice Ossona de Mendez
AU  - Roman Rabinovich
AU  - Sebastian Siebertz
PY  - 2021
JO  - European Journal of Combinatorics
DO  - 10.1016/j.ejc.2020.103223
UR  - https://doi.org/10.1016/j.ejc.2020.103223
ER  -

APA

Nešetřil, J., Mendez, P. O. D., Rabinovich, R., & Siebertz, S. (2021). Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2020.103223

Source records

crossref · retrieved 2026-09-25T20:21:01.715Z