A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs

Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz

Open source

DOI: 10.1137/080723843
Published: 2009-01
Container: SIAM Journal on Discrete Mathematics
Publisher: Society for Industrial & Applied Mathematics (SIAM)
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.1137/080723843,
  title = {A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs},
  author = {Daniel Král' and Jean-Sébastien Sereni and Michael Stiebitz},
  year = {2009},
  journal = {SIAM Journal on Discrete Mathematics},
  doi = {10.1137/080723843},
  url = {https://doi.org/10.1137/080723843}
}

RIS

TY  - JOUR
TI  - A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
AU  - Daniel Král'
AU  - Jean-Sébastien Sereni
AU  - Michael Stiebitz
PY  - 2009
JO  - SIAM Journal on Discrete Mathematics
DO  - 10.1137/080723843
UR  - https://doi.org/10.1137/080723843
ER  -

APA

Král', D., Sereni, J., & Stiebitz, M. (2009). A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/080723843

Source records

crossref · retrieved 2026-09-25T12:04:55.731Z