Theorie der endlichen und unendlichen Graphen

König, D. (1936). Theorie der endlichen und unendlichen Graphen.

Type

Book

Intellectual base

Review or monograph

Year

1936

Link

https://openlibrary.org/works/OL4801832Wmatched

Cited from

mathematics

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Discreteness
  • … use: the role the discreteness plays in the analysis is named — counting (cardinality of finite sets, generating functions, inclusion-exclusion arguments), enumeration (graph-search algorithms, model-checking, exhaustive verification), graph-theoretic analysis* (paths, flows, matchings, colorings, isomorphisms

    This source(Originating systematic textbook treatment of graph theory; consolidates the König-Egerváry duality theorem connecting maximum bipartite matching to minimum vertex cover, the foundation of polynomial-time matching algorithms and the broader development of graph-theoretic combinatorial optimization.)

Domain-specific

• Signed graph
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

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. Neither this nor any other of the 2 citations of this work carries a 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:f290114b9d5e · see in the full table