scientific article; zbMATH DE number 3060538
From MaRDI portal
zbMath0040.10303MaRDI QIDQ5799732
Publication date: 1950
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs, A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\), The transformation and analysis of networks by means of computer algorithms, A theory for nondeterminism, parallelism, communication, and concurrency, A proof of Dilworth's decomposition theorem for partially ordered sets, Menger's theorem for countable graphs, Über HAMILTONsche Linien im Quadrat kubischer und pseudokubischer Graphen, Murky graphs, Irregular embeddings of multigraphs with fixed chromatic number, A vertex-splitting lemma, de Werra's theorem and improper list colourings, Embedding partial triple systems, Menger's theorem for graphs containing no infinite paths, Order and Dimension, The bases of weighted graphs, Infinite kernel perfect digraphs, The cover-index of infinite graphs, Unions of digraphs which become kernel perfect, Structural aspects of controllability and observability. II: Digraph decomposition, Planarity and duality of finite and infinite graphs, On the total correctness of nondeterministic programs, Embedding incomplete Latin squares in Latin squares whose diagonal is almost completely prescribed, Octants are cover-decomposable, Bipartite multigraphs with 1‐factors containing specified edges, Subgraphs and their degree sequences of a digraph, On implementation of some systems of elementary conjunctions in the class of separating contact circuits, On hamiltonian circuits in Cayley diagrams, Generalized latin rectangles. II: Embedding, Matrices of zeros and ones, Concepts of signed graph coloring, The total chromatic number of nearly complete bipartite graphs, Some undecidable termination problems for semi-Thue systems, Online dominating set, -panchromatic digraphs, Infinite matching theory, The age of a relational structure, On complexity of special maximum matchings constructing, Julius Petersen's theory of regular graphs, Unmixed-dimensional decomposition of a finitely generated perfect differential ideal, Diagonal sums of doubly stochastic matrices†, Infinite behaviour of Petri nets, Covers, matchings and odd cycles of a graph, Line perfect graphs, The Birkhoff—Egerváry—Kőnig theorem for matrices over lattice ordered abelian groups, Unnamed Item, Proving containment of bounded AFL, Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen, Value-true walks in finite, connected, valuated graphs, On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility, The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov, Combinatorial aspects of rectangular non-negative matrices, Cubic graphs that cannot be covered with four perfect matchings, Graphs with two kinds of elements, On the degrees of the vertices of a directed graph, A total-chromatic number analogue of Plantholt's theorem, The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small, Disorienting patterns of motion, Optimization of communication nets with switching, How colorful the signed graph?, Sur l'épaisseur des graphes réguliers, An optimization of Seidenberg's elimination algorithm in differential algebra., On the genera of graphs of group presentations. III, On König's theorem for infinite bipartite graphs, A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\), A graph polynomial and its applications, Über modulare Verbände, die von einer endlichen halbgeordneten Menge frei erzeugt werden, Term rank of \(0,1\) matrices, Combinatorial structures in loops. I: Elements of the decomposition theory, The number of caterpillars, Some Remarks on Abstract Machines, Finite Reflection Groups, Two classes of \(q\)-ary codes based on group divisible association schemes, Super-nets and their hierarchy, Terminable and interminable paths and trails in infinite graphs, Embedding an incomplete latin square in a latin square with a prescribed diagonal, Some Results on Doubly Stochastic Matrices, Upper bound for linear arboricity, Bibliography on domination in graphs and some basic definitions of domination parameters, The total chromatic number of regular graphs whose complement is bipartite, An algorithm for prescribed multiple domination in arbitrary graphs, Some sequences associated with combinatorial structures, Representations of locally finite groups, Completing a matrix when certain entries of its inverse are specified
