scientific article; zbMATH DE number 3060538

Cited in

(86)

Super-nets and their hierarchy
Some sequences associated with combinatorial structures
Completing a matrix when certain entries of its inverse are specified
A theory for nondeterminism, parallelism, communication, and concurrency
Menger's theorem for countable graphs
Murky graphs
Embedding partial triple systems
The cover-index of infinite graphs
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
Subgraphs and their degree sequences of a digraph
On hamiltonian circuits in Cayley diagrams
Generalized latin rectangles. II: Embedding
The total chromatic number of nearly complete bipartite graphs
Infinite matching theory
The age of a relational structure
Julius Petersen's theory of regular graphs
Covers, matchings and odd cycles of a graph
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
Two classes of q-ary codes based on group divisible association schemes
The total chromatic number of regular graphs whose complement is bipartite
A vertex-splitting lemma, de Werra's theorem and improper list colourings
The bases of weighted graphs
An optimization of Seidenberg's elimination algorithm in differential algebra.
An algorithm for prescribed multiple domination in arbitrary graphs
Online dominating set
Terminable and interminable paths and trails in infinite graphs
Irregular embeddings of multigraphs with fixed chromatic number
Cubic graphs that cannot be covered with four perfect matchings
Concepts of signed graph coloring
Infinite behaviour of Petri nets
Infinite kernel perfect digraphs
Unions of digraphs which become kernel perfect
Graphs with two kinds of elements
On the degrees of the vertices of a directed graph
Disorienting patterns of motion
Optimization of communication nets with switching
Sur l'épaisseur des graphes réguliers
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
Combinatorial structures in loops. I: Elements of the decomposition theory
The number of caterpillars
A proof of Dilworth's decomposition theorem for partially ordered sets
On implementation of some systems of elementary conjunctions in the class of separating contact circuits
A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
Finite Reflection Groups
Some Remarks on Abstract Machines
Matrices of zeros and ones
Some Results on Doubly Stochastic Matrices
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
Octants are cover-decomposable
Diagonal sums of doubly stochastic matrices^†
Line perfect graphs
The Birkhoff—Egerváry—Kőnig theorem for matrices over lattice ordered abelian groups
Order and Dimension
Bipartite multigraphs with 1‐factors containing specified edges
-panchromatic digraphs
Representations of locally finite groups
The transformation and analysis of networks by means of computer algorithms
Über HAMILTONsche Linien im Quadrat kubischer und pseudokubischer Graphen
scientific article; zbMATH DE number 3375554 (Why is no real title available?)
Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
Menger's theorem for graphs containing no infinite paths
Some progress on the Aharoni-Korman conjecture
Every group-embeddable monoid arises as the bimorphism monoid of some graph
Perfect pseudo-matchings in cubic graphs
Some undecidable termination problems for semi-Thue systems
(k,H)-kernels in nearly tournaments
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
How colorful the signed graph?
Term rank of 0,1 matrices
Embedding an incomplete latin square in a latin square with a prescribed diagonal
Upper bound for linear arboricity
Bibliography on domination in graphs and some basic definitions of domination parameters
On complexity of special maximum matchings constructing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5799732)