Biased graphs. I. Bias, balance, and gains¶
Zaslavsky, T. (1989). Biased graphs. I. Bias, balance, and gains. Journal of Combinatorial Theory, Series B, 32-52.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Biased Graph
- The balance data can then generate frame and lift matroids, but those are derived structures rather than parts of the biased graph's definition.
This sourceAuthor-hosted original scan opened successfully, but it yielded no extractable text; indexed excerpts near Lemma 5.1 and Example 5.8 were checked for the gain realization and its nonautomatic converse.
- The balance data can then generate frame and lift matroids, but those are derived structures rather than parts of the biased graph's definition.
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:ae73c360a3fc · see in the full table