Graphen und Matrices.
Es wird der folgende Satz bewiesen: Für jeden paaren Graphen (jede geschlossene Linie des Graphes hat eine gerade Anzahl von Kanten) ist die Minimalzahl derjenigen Knotenpunkte, welche die Kanten des Graphes erschöpfen, gleich der Maximalzahl von Kanten, welche paarweise keinen gemeinsamen Endpunkt besitzen. Die Knotenpunkte \(P_1\), \(P_2\),\dots, \(P_\nu\) eines Graphen erschöpfen die Kanten, wenn jede Kante in einem der Punkte \(P_i\,(i = 1, 2,\dots, \nu)\) endet. Man kann den Satz in die Sprache der Matrices übersetzen (vgl. in dem vorangehenden Referat den Satz von \textit{Egerváry} im Falle \(a_{ij} = 1, 0\)). (V 2.)
- Flat singularities of chained systems, illustrated with an aircraft model
- Quick or cheap? Breaking points in dynamic markets
- Couplings and matchings: combinatorial notes on Strassen's theorem
- Recognizing distributed approval voting forms and correspondences
- Orientable burning number of graphs
- On the complexity of target set selection in simple geometric networks
- Independence, matching and packing coloring of the iterated Mycielskian of graphs
- Approximating bipartite minimum vertex cover in the Congest model
- S-packing chromatic critical graphs
- On the (total) domination in subdivision graphs
- On the Kőnig-Egerváry index of a graph
- Maximizing the number of maximal independent sets in graphs with a given matching number
- Cover it up! Bipartite graphs uncover identifiability in sparse factor analysis
- Hall's marriage theorem
- Maximum independent set when excluding an induced minor: K₁ + tK₂ and tC₃ C₄
- Exact algorithms for the maximum k-balanced weighted biclique problem
- On decycling and forest numbers of Cartesian products of trees
- A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching
- Bridging theory and practice in bidirectional heuristic search with front-to-end consistent heuristics
- Storylines with a protagonist
- New Menger-like dualities in digraphs and applications to half-integral linkages
- The 1-2 conjecture holds for regular graphs
- Hard problems on box-totally dual integral polyhedra
- A bounded diameter strengthening of Kőnig's theorem
- Eigenvalue approach to dense clusters in hypergraphs
- Orientable burning number of graphs
- On almost bipartite non-König-Egerváry graphs
- Computing subset vertex covers in H-free graphs
- Structural preprocessing method for nonlinear differential-algebraic equations using linear symbolic matrices
- 2-reachable subsets in two-colored graphs
- Total unimodularity: adding a row or a column to the incidence matrix of a directed graph
- An 11/6-approximation algorithm for vertex cover on string graphs
- Bipartite graphs with minimum degree at least 15 are antimagic
This page was built for publication: Graphen und Matrices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q577965)
