Matroids of Gain Signed Graphs¶
Anderson, L., Su, T., & Zaslavsky, T. (2022). Matroids of Gain Signed Graphs.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Biased Graph
- The abstraction therefore lets results be stated about the balanced-cycle class instead of separately re-proving them for each label alphabet.
This sourceAuthor abstract directly checked for signed-edge and gain-edge label distinction.
- The abstraction therefore lets results be stated about the balanced-cycle class instead of separately re-proving them for each label alphabet.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
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:f4cbf9c6de6b · see in the full table