Note on the path-matching formula

Frank, A., & Szegő, L. (2002). Note on the path-matching formula. Journal of Graph Theory.

Type

Journal article

Intellectual base

Primary research

Year

2002

DOI

10.1002/jgt.10055

DOI registrant

Wiley

Link

https://doi.org/10.1002/jgt.10055

Cited by

1 citation across 1 artifact.

Domain-specific

• Factor-critical graph
  • … between constitutive identity and a convenient observable transfers from Every odd cycle is factor-critical because deleting any vertex leaves an even path with a perfect matching. to An algorithm verifies odd order and constructs matchings or an odd-ear decomposition rather than relying on high degree alone..

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:8af0b372d109 · see in the full table