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

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:f290114b9d5e · see in the full table