Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre

@article{KnigberGU,
  title={{\"U}ber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre},
  author={D. K{\"o}nig},
  journal={Mathematische Annalen},
  volume={77},
  pages={453-465}
}
On Structural Rank and Resilience of Sparsity Patterns
A sparsity pattern in Rn×m, for m ≥ n, is a vector subspace of matrices admitting a basis consisting of canonical basis vectors in Rn×m. We represent a sparsity pattern by a matrix with 0/?-entries,Expand
SOME ASPECTS ON SOLVING TRANSPORTATION PROBLEM
In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices to these transportation problems are ofExpand
Some Aspects on Solving Transportation Problem
In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices of these transportation problems are ofExpand
Graph Edge Coloring: A Survey
TLDR
This survey, written for the non-expert, shall describe some main results and techniques in graph edge coloring and state some of the many popular conjectures in the theory. Expand
Color-Connected Graphs and Information-Transfer Paths
(r,s,t)-Colouring of Paths, Cycles and Stars
Circulant association schemes on triples
Association Schemes and coherent configurations (and the related Bose-Mesner algebra and coherent algebras) are well known in combinatorics with many applications. In the 1990s, Mesner andExpand
Doubly stochastic matrices and Schur-Weyl duality for partition algebras
In 1916 Dénes König proved that the permanent of a doubly stochastic matrix is positive; equivalently, the matrix has a positive diagonal. König’s result is equivalent to Birkhoff’s 1946 result, thatExpand
List colouring of two matroids through reduction to partition matroids
TLDR
The present paper considers matroid classes that appear naturally in combinatorial and graph optimization problems, namely graphic matroids, pavingMatroids and gammoids, and shows that if both matros are from these fundamental classes, then the list colouring number is at most twice the colouringnumber. Expand
Choosability in coloring problems of graphs with restricted color lists
TLDR
This work applied special techniques to prove the property of choosability in some classes of graphs, involving a general proof for simple graphs, which guarantees that if a graph is k-colorable it is also k-(Y, μ)-choosable, being the computational complexity reduced from the class Π2p-complete to the NP-complete. Expand
...
1
2
3
4
5
...

References

Die Theorie der regulären graphs