On feedback vertex sets and nonseparating independent sets in cubic graphs

Speckenmeyer, E. (1988). On feedback vertex sets and nonseparating independent sets in cubic graphs.

Type

Unclassified

Intellectual base

Unclassified

Year

1988

DOI

10.1002/jgt.3190120311

Link

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

Cited by

1 citation across 1 artifact.

Domain-specific

• Matroid parity problem
  • For example, the distinction between constitutive identity and a convenient observable transfers from Graph matching is encoded as parity in a suitable graphic or linear matroid construction. to A linear-matroid instance is solved with a polynomial algorithm while an oracle-model claim states its query lower bounds..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:f97c0b82dc16 · see in the full table